✦ LIBER ✦

Randomized Complexity Lower Bound for Arrangements and Polyhedra

✍ Scribed by D. Grigoriev

Book ID: 105746641
Publisher: Springer
Year: 1999
Tongue: English
Weight: 217 KB
Volume: 21
Category: Article
ISSN: 0179-5376
DOI: 10.1007/pl00009425

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the complexity of the c

A lower bound on the complexity of the convex hull problem for simple polyhedra

✍ Andrew Klapper 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 181 KB

Lower Bounds for Randomized and Quantum

Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments

✍ Laplante, Sophie; Magniez, Frédéric 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 260 KB

Random restricted matching and lower bou

Random restricted matching and lower bounds for

✍ Stefan Steinerberger 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 610 KB

Generating lower bounds for the linear a

Generating lower bounds for the linear arrangement problem

✍ Weiguo Liu; Anthony Vannelli 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 806 KB

Lower Bounds for Randomized Mutual Exclu

Lower Bounds for Randomized Mutual Exclusion

✍ Kushilevitz, Eyal; Mansour, Yishay; Rabin, Michael O.; Zuckerman, David 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 284 KB

Complexity lower bounds for randomized c

Complexity lower bounds for randomized computation trees over zero characteristic fields

✍ D. Grigoriev 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 272 KB