Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation (2000)

Cached

Download Links

by Paul Beame , Michael Saks , Xiaodong Sun , Erik Vee
Citations:33 - 0 self

Active Bibliography

44 Time-Space Tradeoffs for Branching Programs – Paul Beame, Michael Saks, Jayram S. Thathachar - 1999
28 Time-Space Tradeoff Lower Bounds for Randomized Computation of Decision Problems – Paul Beame, Michael Saks, Xiaodong Sun, Erik Vee - 2000
2 Binary Decision Diagrams – Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
2 Approximation of Boolean Functions by Combinatorial Rectangles – Martin Sauerhoff - 2000
6 Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds – Hartmut Klauck
19 Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems – Paul Beame, Erik Vee - 2002
42 Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs – Hartmut Klauck, Robert Spalek, Ronald De Wolf - 2004
9 Complexity Theoretical Results for Randomized Branching Programs – Martin Sauerhoff - 1998
37 Determinism versus Non-Determinism for Linear Time RAMs with Memory Restrictions – Miklos Ajtai - 1998
55 A non-linear time lower bound for boolean branching programs – Miklós Ajtai - 1999
On Lower Bounds for Read-k-Times – A. Borodin, A. Razborov, R. Smolensky - 1993
47 Lower bounds for high dimensional nearest neighbor search and related problems – Allan Borodin, Rafail Ostrovsky, Yuval Rabani - 1999
10 Algorithms and Resource Requirements for Fundamental Problems – R. Ryan Williams - 2007
Quantum Branching Programs and Space-Bounded Nonuniform Quantum Complexity – unknown authors - 2005
4 Quantum branching programs and spacebounded nonuniform quantum complexity – Martin Sauerhoff, Detlef Sieling - 2005
5 Comparison-Based Time–Space Lower Bounds for Selection – Timothy M. Chan
General Terms Theory – Martin Sauerhoff
58 The Computational Complexity of Universal Hashing – Yishay Mansour, Noam Nisan, Prasoon Tiwari - 2002
8 Communication-space tradeoffs for unrestricted protocols – Paul Beame, Martin Tompa, Peiyuan Yan - 1994