A survey of lower bounds for satisfiability and related problems

Foundations and Trends in Theoretical Computer Science

Volumn 2, Issue 3, 2006, Pages 197-303

  van Melkebeek, Dieter ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SET THEORY;

LOWER BOUNDS; SATISFIABILITY; SPACE COMPLEXITY; TIME COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 38349037641     PISSN: 1551305X     EISSN: 15513068     Source Type: Journal    
DOI: 10.1561/0400000012     Document Type: Article

References (63)

1. L. Adleman, J. DeMarrais, and M. Huang, "Quantum computability," SIAM Journal on Computing, vol. 26, pp. 1524-1540, 1997.
2. M. Ajtai, "A non-linear time lower bound for Boolean branching programs," in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pp. 60-70, IEEE, 1999.
3. E. Allender, M. Koucky, D. Ronneburger, S. Roy, and V. Vinay, "Time-space tradeoffs in the counting hierarchy," in Proceedings of the 16th IEEE Conference on Computational Complexity, pp. 295-302, IEEE, 2001.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, "Proof verification and the hardness of approximation problems," Journal of the ACM, vol. 45, no. 3, pp. 501-555, 1998.
5. L. Babai, "Trading group theory for randomness," in Proceedings of the 17th ACM Symposium on the Theory of Computing, pp. 421-429, ACM, 1985.
6. L. Babai and S. Moran, "Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes," Journal of Computer and System Sciences, vol. 36, pp. 254-276, 1988.
7. P. Beame, M. Saks, X. Sun, and E. Vee, "Time-space trade-off lower bounds for randomized computation of decision problems," Journal of the ACM, vol. 50, no. 2, pp. 154-195, 2003.
8. E. Bernstein and U. Vazirani, "Quantum complexity theory," SIAM Journal on Computing, vol. 26, pp. 1411-1473, 1997.
9. R. Boppana and M. Sipser, "Complexity of finite functions," in Handbook of Theoretical Computer Science, (J. van Leeuwen, ed.), pp. 758-804, MIT Press, 1990.
10. A. Chiu, Complexity of Parallel Arithmetic Using The Chinese Remainder Representation. Master's thesis, University of Wisconsin-Milwaukee, 1995.
11. 1," Theoretical Informatics and Applications, vol. 35, pp. 259-276, 2001.
12. A. Cohen and A. Wigderson, "Dispersers, deterministic amplification, and weak random sources," in Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pp. 14-19, IEEE, 1989.
13. S. Cook, "A hierarchy theorem for nondeterministic time complexity," Journal of Computer and System Sciences, vol. 7, pp. 343-353, 1973.
14. S. Cook, "Short propositional formulas represent nondeterministic computations," Information Processing Letters, vol. 26, pp. 269-270, 1988.
15. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms. MIT Press, 2nd ed., 2001.
16. S. Diehl, "Lower bounds for swapping Arthur and Merlin," in Proceedings of the 11th International Workshop on Randomized Techniques in Computation, pp. 449-463, Springer-Verlag, 2007.
17. S. Diehl and D. van Melkebeek, "Time-space lower bounds for the polynomial-time hierarchy on randomized machines," SIAM Journal on Computing, vol. 36, pp. 561-594, 2006.
18. S. Diehl, D. van Melkebeek, and R. Williams, "A new time-space lower bound for nondeterministic algorithms solving tautologies," Tech. Rep. 1601, Department of Computer Sciences, University of Wisconsin-Madison, 2007.
19. L. Fortnow, "Time-space tradeoffs for satisfiability," Journal of Computer and System Sciences, vol. 60, pp. 337-353, 2000.
20. L. Fortnow, R. Lipton, D. van Melkebeek, and A. Viglas, "Time-space lower bounds for satisfiability," Journal of the ACM, vol. 52, pp. 835-865, 2005.
21. L. Fortnow and J. Rogers, "Complexity limitations on quantum computations," Journal of Computer and System Sciences, vol. 59, pp. 240-252, 1990.
22. L. Fortnow and D. van Melkebeek, "Time-space tradeoffs for nondeterministic computation," in Proceedings of the 15th IEEE Conference on Computational Complexity, pp. 2-13, IEEE, 2000.
23. O. Gabber and Z. Galil, "Explicit constructions of linear-sized superconcentrators," Journal of Computer and System Sciences, vol. 22, pp. 407-420, 1981.
24. O. Goldreich and D. Zuckerman, "Another proof that BPP C PH (and more)," Tech. Rep. TR-97-045, Electronic Colloquium on Computational Complexity, 1997.
25. J. Hastad, "The shrinkage exponent of de Morgan formulas is 2," SIAM Journal on Computing, vol. 27, pp. 48-64, 1998.
26. F. Hennie and R. Stearns, "Two-tape simulation of multitape Turing machines," Journal of the ACM, vol. 13, pp. 533-546, 1966.
27. 0," in Proceedings of the 28th International Colloquium On Automata, Languages and Programming, pp. 104-114, Springer-Verlag, 2001.
28. W. Hesse, E. Allender, and D. M. Barrington, "Uniform constant-depth thresh old circuits for division and iterated multiplication," Journal of Computer and System Sciences, vol. 65, pp. 695-712, 2002.
29. R. Impagliazzo, N. Nisan, and A. Wigderson, "Pseudorandomness for network algorithms," in Proceedings of the 26th ACM Symposium on the Theory of Computing, pp. 356-364, ACM, 1994.
30. R. Impagliazzo and D. Zuckerman, "How to recycle random bits," in Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pp. 248-253, IEEE, 1989.
31. R. Kannan, "Towards separating nondeterminism from determinism," Mathematical Systems Theory, vol. 17, pp. 29-45, 1984.
32. R. Kannan, H. Venkateswaran, V. Vinay, and A. Yac, "A circuit-based proof of Toda's theorem," Information and Computation, vol. 104, pp. 271-276, 1993.
33. R. Karp and R. Lipton, "Turing machines that take advice," L'Enseignement Mathématique, vol. 28, no. 2, pp. 191-209, (A preliminary version appeared in STOC 1980), 1982.
34. A. Kitaev, "Quantum computations: Algorithms and error correction," Russian Mathematical Surveys, vol. 52, pp. 1191-1249, 1997.
35. A. Kitaev, A. Shen, and M. Vyalyi, Classical and Quantum Computation. American Mathematical Society, 2002.
36. C. Lautemann, "BPP and the polynomial hierarchy," Information Processing Letters, vol. 17, pp. 215-217, 1983.
37. R. Lipton and A. Viglas, "On the complexity of SAT," in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pp. 459-464, IEEE, 1999.
38. G. Margulis, "Explicit construction of concentrators," Problems of Information Transmission, vol. 9, pp. 325-332, 1973.
39. D. van Melkebeek, "Time-space lower bounds for NP-complete problems," in Current Trends in Theoretical Computer Science, (G. Paun, G. Rozenberg, and A. Salomaa, eds.), pp. 265-291, World Scientific, 2004.
40. D. van Melkebeek and K. Pervyshev, "A generic time hierarchy for semantic models with one bit of advice," Computational Complexity, vol. 16, pp. 139-179, 2007.
41. D. van Melkebeek and T. Watson, "A quantum time-space lower bound for the counting hierarchy," Tech. Rep. 1600, Department of Computer Sciences, University of Wisconsin-Madison, 2007.
42. A. Naik, K. Regan, and D. Sivakumar, "On quasilinear-time complexity theory," Theoretical Computer Science, vol. 148, pp. 325-349, 1995.
43. V. Nepomnjascii, "Rudimentary predicates and Turing calculations," Soviet Mathematics-Doklady, vol. 11, pp. 1462-1465, 1970.
44. M. Nielsen and I. Chuang, Quantum Computation and Quantum Information. Cambridge University Press, 2000.
45. N. Nisan, "Pseudorandom generators for space-bounded computation," Combinatorica, vol. 12, pp. 449-461, 1992.
46. N. Nisan, "RL C SC," Computational Complexity, vol. 4, pp. 1-11, 1994.
47. N. Nisan and A. Wigderson, "Hardness vs. randomness," Journal of Computer and System Sciences, vol. 49, pp. 149-167, 1994.
48. N. Pippenger and M. Fischor, "Relations among complexity measures," Journal of the ACM, vol. 26, pp. 361-381, 1979.
49. J. Robson, "An O(T log T) reduction from RAM computations to satisfiability," Theoretical Computer Science, vol. 82, pp. 141-149, 1991.
50. W. Ruzzo, "Tree-size bounded alternation," Journal of Computer and System Sciences, vol. 21, pp. 218-235, 1980.
51. W. Savitch, "Relationships between nondeterministic and deterministic tape complexities," Journal of Computer and System Sciences, vol. 4, pp. 177-192, 1970.
52. J. Seiferas, M. Fischer, and A. Meyer, "Separating nondeterministic time complexity classes," Journal of the ACM, vol. 25, pp. 146-167, 1978.
53. M. Sipser, "A complexity theoretic approach to randomness," in Proceedings of the 15th ACM Symposium on the Theory of Computing, pp. 330-335, ACM, 1983.
54. S. Toda, "PP is as hard as the polynomial-time hierarchy," SIAM Journal on Computing, vol. 20, no. 5, pp. 865-877, 1991.
55. J. Toran, "Complexity classes defined by counting quantifiers," Journal of the ACM, vol. 38, pp. 753-774, 1991.
56. I. Tourlakis, "Time-space lower bounds for SAT on nonuniform machines," Journal of Computer and System Sciences, vol. 63, no. 2, pp. 268-287, 2001.
57. L. Valiant and V. Vazirani, "NP is as easy as detecting unique solutions," Theoretical Computer Science, vol. 47, pp. 85-93, 1986.
58. E. Viola, "On approximate majority and probabilistic time," in Proceedings of the 22nd IEEE Conference on Computational Complexity, pp. 155-168, IEEE, 2007.
59. R. Williams, "Better time-space lower bounds for SAT and related problems," in Proceedings of the 20th IEEE Conference on Computational Complexity, pp. 40-49, IEEE, 2005.
60. R. Williams, Algorithms and resource requirements for fundamental problems. PhD thesis, Carnegie Mellon Univesity, 2007.
61. R. Williams, "Time-space tradeoffs for counting NP solutions modulo integers," in Proceedings of the 22nd IEEE Conference on Computational Complexity, pp. 70-82, IEEE, 2007.
62. C. Yap, "Some consequences of non-uniform conditions on uniform classes," Theoretical Computer Science, vol. 26, pp. 287-300, 1983.
63. S. Zak, "A Turing machine time hierarchy," Theoretical Computer Science, vol. 26, pp. 327-333, 1983.