✦ LIBER ✦

Complexity lower bounds for machine computing models

✍ Scribed by A. P. Bel'tyukov

Publisher: Springer US
Year: 1985
Tongue: English
Weight: 1002 KB
Volume: 29
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf02104744

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for the approximative compl

Lower bounds for the approximative complexity

✍ Bernhard Griesser 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 440 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

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 single-machine scheduli

Lower bounds for single-machine scheduling problems

✍ Reza H. Ahmadi; Uttarayan Bagchi 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 588 KB

Easy lower bound for a strange computati

Easy lower bound for a strange computational model

✍ Roman Smolensky 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 180 KB

Entropy lower bounds for quantum decisio

Entropy lower bounds for quantum decision tree complexity

✍ Yaoyun Shi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 70 KB

We prove a general lower bound of quantum decision tree complexity in terms of some entropy notion. We regard decision tree computation as a communication process in which the oracle and the computer exchange several rounds of messages, each round consisting of O(log n) bits. Let E(f ) be the Shanno