𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Gems of Theoretical Computer Science || Equivalence Problems and Lower Bounds for Branching Programs

✍ Scribed by Schöning, Uwe; Pruim, Randall

Book ID
120245046
Publisher
Springer Berlin Heidelberg
Year
1998
Weight
754 KB
Category
Article
ISBN
364260322X

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