✦ LIBER ✦

Easy lower bound for a strange computational model

✍ Scribed by Roman Smolensky

Publisher: Springer
Year: 1996
Tongue: English
Weight: 180 KB
Volume: 6
Category: Article
ISSN: 1016-3328
DOI: 10.1007/bf01294255

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity lower bounds for machine comp

Complexity lower bounds for machine computing models

✍ A. P. Bel'tyukov 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 1002 KB

Maximizing a lower bound on the computat

Maximizing a lower bound on the computational complexity

✍ Georg Gati 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 294 KB

Lower bounds on the computational power

Lower bounds on the computational power of an optical model of computation

✍ Damien Woods; J. Paul Gibson 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 925 KB

Complexity Lower Bounds for Approximatio

Complexity Lower Bounds for Approximation Algebraic Computation Trees

✍ Felipe Cucker; Dima Grigoriev 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 159 KB

We prove lower bounds for approximate computations of piecewise polynomial functions which, in particular, apply for round-off computations of such functions.

A Lower Bound for Primality

✍ Eric Allender; Michael Saks; Igor Shparlinski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Recent work by Bernasconi, Damm, and Shparlinski showed that the set of square-free numbers is not in AC 0 and raised as an open question whether similar (or stronger) lower bounds could be proved for the set of prime numbers. We show that the Boolean majority function is AC 0 -Turing reducible to t

Strict Lower Bounds for Model Checking B

Strict Lower Bounds for Model Checking BPA

✍ Richard Mayr 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 697 KB