𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lower bound for read-once-only branching programs

✍ Scribed by László Babai; Péter Hajnal; Endre Szemerédi; György Turán

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
582 KB
Volume
35
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A read-once lower bound and a (1,+k)-hie
A read-once lower bound and a (1,+k)-hierarchy for branching programs
✍ P. Savický; S. Žák 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 143 KB

Branching programs (b. p.'s) or decision diagrams are a general graph-based model of sequential computation. The b. p.'s of polynomial size are a nonuniform counterpart of LOG. Lower bounds for di erent kinds of restricted b. p.'s are intensively investigated. An important restriction are the so-cal

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

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