๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Inductive Counting for Width-Restricted Branching Programs

โœ Scribed by Carsten Damm; Markus Holzer

Book ID
112252261
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
725 KB
Volume
130
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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