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

Cached

Download Links

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

Documents Related by Co-Citation

57 A non-linear time lower bound for boolean branching programs – Miklós Ajtai - 1999
159 Branching Programs and Binary Decision Diagrams : Theory and Applications – I Wegener - 2000
2976 Graph-based algorithms for Boolean function manipulation – Randal E. Bryant - 1986
623 Multiparty Communication Complexity – Danny Dolev, Tomás Feder - 1989
43 Time-Space Tradeoffs for Branching Programs – Paul Beame, Michael Saks, Jayram S. Thathachar - 1999
36 Determinism versus Non-Determinism for Linear Time RAMs with Memory Restrictions – Miklos Ajtai - 1998
1382 Quantum Computation and Quantum Information – Michael A Nielsen, Isaac L Chuang - 2000
857 A Fast Quantum Mechanical Algorithm for Database Search – Lov K. Grover - 1996
810 Matrix multiplication via arithmetic progressions – Don Coppersmith, Shmuel Winograd - 1990