✦ LIBER ✦

Lower bounds for algebraic decision trees

✍ Scribed by J Michael Steele; Andrew C Yao

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 445 KB
Volume: 3
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(82)90002-5

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.

Simplified Lower Bounds for Polynomials

Simplified Lower Bounds for Polynomials with Algebraic Coefficients

✍ Walter Baur 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 89 KB

Lower bounds for rectilinear Steiner tre

Lower bounds for rectilinear Steiner trees in bounded space

✍ Timothy Law Snyder 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 438 KB

A note on lower bounds for rectilinear S

A note on lower bounds for rectilinear Steiner trees

✍ J.S. Salowe 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 98 KB

Lower bounds for commutative radical Ban

Lower bounds for commutative radical Banach algebras

✍ Marc P Thomas 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 438 KB

Lower bounds for the relative greedy alg

Lower bounds for the relative greedy algorithm for approximating Steiner trees

✍ Stefan Hougardy; Stefan Kirchner 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB