Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > OBLIVIOUS ALGORITHMS:
Reports tagged with Oblivious Algorithms:
TR10-104 | 29th June 2010
Paul Beame, Widad Machmouchi

Making RAMs Oblivious Requires Superlogarithmic Overhead

Revisions: 3 , Comments: 1

We prove a time-space tradeoff lower bound of $T =
\Omega\left(n\log(\frac{n}{S}) \log \log(\frac{n}{S})\right) $ for
randomized oblivious branching programs to compute $1GAP$, also
known as the pointer jumping problem, a problem for which there is a
simple deterministic time $n$ and space $O(\log n)$ RAM (random
access machine) algorithm.

In ... more >>>




ISSN 1433-8092 | Imprint