Super-linear time-space tradeoff lower bounds for randomized computation

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 169-179

  Beame, Paul ^a   Saks, Michael ^b   Sun, Xiaodong ^b   Vee, Erik ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DECISION THEORY; ERROR CORRECTION; PROBLEM SOLVING; RANDOM PROCESSES;

SUPER-LINEAR TIME-SPACE TRADEOFF LOWER BOUNDS;

COMPUTER SCIENCE;

EID: 0034512732     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892078     Document Type: Article

References (18)

1. Κ. R. Abrahamson A time-space tradeoff for Boolean matrix multiplication Proceedings 31st Annual Symposium on Foundations of Computer Science 412 419 Proceedings 31st Annual Symposium on Foundations of Computer Science St. Louis MO 1990-Oct.
2. K. R. Abrahamson Time—space tradeoffs for algebraic problems on general sequential models Journal of Computer and System Sciences 43 2 269 289 Oct. 1991
3. M. Ajtai Determinism versus non-determinism for linear time RAMs with memory restrictions 1998 TR98-077 http: //www. eccc. uni trier.de/eccc/
4. M. Ajtai Determinism versus non-determinism for linear time RAMs with memory restrictions Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing 1999
5. M. Ajtai A non-linear time lower bound for boolean branching programs Proceedings of the 40th Annual Symposium on Foundations of Computer Science Proceedings of the 40th Annual Symposium on Foundations of Computer Science 1999
6. L. Babai P. Frankl J. Simon Complexity classes in communication complexity theory 27th Annual Symposium on Foundations of Computer Science 337 347 27th Annual Symposium on Foundations of Computer Science Toronto 1986-Oct.
7. P. W. Beame A general time-space tradeoff for finding unique elements SIAM Journal on Computing 20 2 270 277 1991
8. P. W. Beame M. Saks J. S. Thathachar Time-space tradeoffs for branching programs Proceedings 39th Annual Symposium on Foundations of Computer Science 254 263 Proceedings 39th Annual Symposium on Foundations of Computer Science Palo Alto CA 1998-Nov.
9. A. Borodin Time space tradeoffs (getting closer to the barrier?) 4th International Symposium on Algorithms and Computation 209 229 4th International Symposium on Algorithms and Computation Hong Kong 1993-Dec.
10. A. Borodin S. A. Cook A time-space tradeoff for sorting on a general sequential model of computation SIAM Journal on Computing 11 2 287 297 May 1982
11. A. Borodin F. E. Fich F. M. A. D. Heide E. Upfal A. Wigderson A time-space tradeoff for element distinctness SIAM Journal on Computing 16 1 97 99 Feb. 1987
12. A. Borodin M. J. Fischer D. G. Kirkpatrick N. A. Lynch M. Tompa A time-space tradeoff for sorting on non-oblivious machines Journal of Computer and System Sciences 22 3 351 364 June 1981
13. A. Borodin A. A. Razborov R. Smolensky On lower bounds for read-k times branching programs Computational Complexity 3 1 18 Oct. 1993
14. L. Fortnow Nondeterministic polynomial time versus nondeterministic logarithmic space: Time-space tradeoffs for satisfiability Proceedings, Twelfth Annual IEEE Conference on Computational Complexity 52 60 Proceedings, Twelfth Annual IEEE Conference on Computational Complexity Ulm Germany 1997-June-24-27
15. L. Fortnow D. van Melkebeek Time-space tradeoffs for nondeterministic computation Proceedings, Fifteenth Annual IEEE Conference on Computational Complexity Proceedings, Fifteenth Annual IEEE Conference on Computational Complexity 2000-July
16. R. Lipton A. Viglas Time-space tradeoffs for sat Proceedings of the 40th Annual Symposium on Foundations of Computer Science Proceedings of the 40th Annual Symposium on Foundations of Computer Science 1999
17. Y. Mansour N. Nisan P. Tiwari The computational complexity of universal hashing Theoretical Computer Science 107 121 133 1993
18. A. C. Yao Near-optimal time-space tradeoff for element distinctness 29th Annual Symposium on Foundations of Computer Science 91 97 29th Annual Symposium on Foundations of Computer Science White Plains NY 1988-Oct.