Time-space lower bounds for the polynomial-time hierarchy on randomized machines

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 982-993

  Diehl, Scott ^a   Van Melkebeek, Dieter ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR ANALYSIS; HIERARCHICAL SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

POLYNOMIAL-TIME HIERARCHY; RANDOMIZED MACHINES;

COMPUTER SCIENCE;

EID: 26444473600     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_79     Document Type: Conference Paper

References (13)

1. E. Allender, M. Koucky, D. Ronneburger, S. Roy, and V. Vinay. Time-space tradeoffs in the counting hierarchy. In CCC, pages 295-302. IEEE, 2001.
2. P. Beame, M. Saks, X. Sun, and E. Vee. Time-space tradeoff lower bounds for randomized computation of decision problems. Journal of the ACM, 50(2): 154-195, 2003.
3. J. Balcázar, J. Díaz, J. Gabarró. Structural Complexity I, volume 11 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1995.
4. L. Fortnow and D. van Melkebeek. Time-space tradeoffs for nondeterministic computation. In CCC, pages 2-13. IEEE, 2000.
5. L. Fortnow. Time-space tradeoffs for satisfiability. Journal of Computer and System Sciences, 60:337-353, 2000.
6. R. Kannan. Towards separating nondeterminism from determinism. Mathematical Systems Theory, 17:29-45, 1984.
7. C. Lautemann. BPP and the polynomial hierarchy. Information Processing Letters, 17(4):215-217, 1983.
8. R. Lipton and A. Viglas. On the complexity of SAT. In FOCS, pages 459-464. IEEE, 1999.
9. D. van Melkebeek. Time-Space Lower Bounds for NP-Complete Problems. In G. Paun, G. Rozenberg, and A. Salomaa, editors, Current Trends in Theoretical Computer Science, pages 265-291. World Scientific, 2004.
10. N. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
11. N. Nisan. RL ⊆ SC. Computational Complexity, 4:1-11, 1994.
12. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
13. R. Williams. Better Time-Space Lower Bounds for SAT and Related Problems. To appear in CCC. IEEE, 2005.