We prove a time-space tradeoff lower bound of $T =\Omega\left(n\log(\frac{n}{S}) \log \log(\frac{n}{S})\right) $ forrandomized oblivious branching programs to compute $1GAP$, alsoknown as the pointer jumping problem, a problem for which there is asimple deterministic time $n$ and space $O(\log n)$ RAM (randomaccess machine) algorithm.%Although no simulations of general%computation on randomized oblivious algorithms requiring only%polylogarithmic increase in time and space are yet known, our… CONTINUE READING