Time-Space Tradeoffs for Branching Programs

We obtain the first non-trivial time space tradeoff lower bound for functions f:{0, 1}n {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be ...