Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems

• Authors: Paul Beame;Erik Vee
• Venue: STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
• Year: 2002

(MATH) We extend recent techniques for time-space tradeoff lower bounds using multiparty communication complexity ideas. Using these arguments, for inputs from large domains we prove larger tradeoff lower bounds than previously known for general branching programs, yielding time lower bounds of the form $T=\Omega(n\log^2 n)$ when space $S=n^{1-\epsilon}$, up from $T=\Omega(n\log n)$ for the best previous results. We also prove the first unrestricted separation of the power of general and oblivious branching programs by proving that \onegap, which is trivial on general branching programs, has a time-space tradeoff of the form $T=\Omega(n\log^2 (n/S))$ on oblivious branching programs.Finally, using time-space tradeoffs for branching programs, we improve the lower bounds on query time of data structures for nearest neighbor problems in $d$ dimensions from $\Omega(d/\log n)$, proved in the cell-probe model \cite{bor:nn-lb,br:nn-lb}, to $\Omega(d)$ or $\Omega(d\sqrt{\log d/\log\log d})$ or even $\Omega(d\log d)$ (depending on the metric space involved) in slightly less general but more reasonable data structure models.