✦ LIBER ✦

Complexity lower bounds for randomized computation trees over zero characteristic fields

✍ Scribed by D. Grigoriev

Publisher: Springer
Year: 1999
Tongue: English
Weight: 272 KB
Volume: 8
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s000370050002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Lower bounds for the non-linear complexi

Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs

✍ Michael D. Hirsch 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 687 KB