TimeβSpace Tradeoffs for Branching Progr
β
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