✦ LIBER ✦

Lower bounds on space complexity for contextfree recognition

✍ Scribed by Helmut Alt

Publisher: Springer-Verlag
Year: 1979
Tongue: English
Weight: 913 KB
Volume: 12
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00264016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound for the nondeterministic s

A lower bound for the nondeterministic space complexity of context-free recognition

✍ Helmut Alt; Viliam Geffert; Kurt Mehlhorn 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Lower bounds for the approximative compl

Lower bounds for the approximative complexity

✍ Bernhard Griesser 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 440 KB

Lower Bounds on the Multiparty Communica

Lower Bounds on the Multiparty Communication Complexity

✍ Pavol Ďuriš; José D.P. Rolim 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Lower bounds for the complexity of polyn

Lower bounds for the complexity of polynomials

✍ Hans-Jörg Stoß 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 936 KB

A Gödel Theorem on Network Complexity Lo

A Gödel Theorem on Network Complexity Lower Bounds

✍ C. P. Schnorr 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 550 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.