𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Expanders and time-restricted branching programs

✍ Scribed by Stasys Jukna

Book ID
108281489
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
431 KB
Volume
409
Category
Article
ISSN
0304-3975

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

Time–Space Tradeoffs for Branching Progr
Time–Space Tradeoffs for Branching Programs
✍ Paul Beame; T.S. Jayram; Michael Saks πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 265 KB

We obtain the first non-trivial time-space tradeoff lower bound for functions f: {0, 1} n Q {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be computed by any branching program of length (1+e) n, for some constant e > 0. We also give the firs