✦ LIBER ✦

Lower Bounds for Dynamic Algebraic Problems

✍ Scribed by Gudmund Skovbjerg Frandsen; Johan P Hansen; Peter Bro Miltersen

Book ID: 112252636
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 131 KB
Volume: 171
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.2001.3046

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds for Dynamic Data Structures

Lower Bounds for Dynamic Data Structures on Algebraic RAMs

✍ A. M. Ben-Amram and Z. Galil 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 269 KB

Lower bounds for algebraic decision tree

Lower bounds for algebraic decision trees

✍ J Michael Steele; Andrew C Yao 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 445 KB

Lower bounds for polynomials with algebr

Lower bounds for polynomials with algebraic coefficients

✍ Joos Heintz; Malte Sieveking 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 1012 KB

Lower Bounds for Covering Problems

✍ Michael Segal 📂 Article 📅 2002 🏛 Springer Netherlands 🌐 English ⚖ 136 KB

Lower bounds for arithmetic problems

✍ João Meidânis 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 543 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.