Making Branching Programs Oblivious Requires Superlogarithmic Overhead

  title={Making Branching Programs Oblivious Requires Superlogarithmic Overhead},
  author={Paul Beame and Widad Machmouchi},
  journal={2011 IEEE 26th Annual Conference on Computational Complexity},
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


Publications citing this paper.
Showing 1-3 of 3 extracted citations


Publications referenced by this paper.
Showing 1-10 of 23 references

Probabilistic computations: Toward a unified measure of complexity

18th Annual Symposium on Foundations of Computer Science (sfcs 1977) • 1977
View 5 Excerpts
Highly Influenced

Efficient Computation on Oblivious RAMs

STOC • 1990
View 1 Excerpt
Highly Influenced

Oblivious RAMs without cryptographic assumptions

Noga Alon, Wolfgang Maass
Technical Report TR 10028 , Electronic Colloquium in Computation Complexity • 2010

Similar Papers

Loading similar papers…