✦ LIBER ✦

Lower bounds for depth-restricted branching programs

✍ Scribed by Matthias Krause

Book ID: 113383997
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 825 KB
Volume: 91
Category: Article
ISSN: 0890-5401
DOI: 10.1016/0890-5401(91)90072-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Lower Bounds and Hierarchy Results f

New Lower Bounds and Hierarchy Results for Restricted Branching Programs

✍ Detlef Sieling 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 404 KB

In unrestricted branching programs all variables may be tested arbitrarily often on each path. But exponential lower bounds are only known if on each path the number of tests of each variable is bounded. We examine branching programs in which for each path the number of variables that are tested mor

Superlinear Lower Bounds for Bounded-Wid

Superlinear Lower Bounds for Bounded-Width Branching Programs

✍ D.A.M. Barrington; H. Straubing 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 635 KB

We use algebraic techniques to obtain superlinear lower bounds on the size of bounded-width branching programs to solve a number of problems. In particular, we show that any bounded-width branching program computing a nonconstant threshold function has length \(\Omega(n \log \log n)\), improving on

Inductive Counting for Width-Restricted

Inductive Counting for Width-Restricted Branching Programs

✍ Carsten Damm; Markus Holzer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 725 KB

An exponential lower bound for real-time

An exponential lower bound for real-time branching programs

✍ Stanislav ák 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 415 KB

A lower bound for read-once-only branchi

A lower bound for read-once-only branching programs

✍ László Babai; Péter Hajnal; Endre Szemerédi; György Turán 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 582 KB

Lower bounds for monotone span programs

✍ Amos Beimel; Anna Gál; Mike Paterson 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 900 KB