Improving exhaustive search implies superpolynomial lower bounds

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 231-240

  Williams, Ryan ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

exact algorithms; improved exponential algorithms; lower bounds; time space tradeoffs

Indexed keywords

DETERMINISTIC SIMULATION; EXACT ALGORITHMS; EXHAUSTIVE SEARCH; EXPONENTIAL ALGORITHMS; HARD PROBLEMS; LOGSPACE; LOWER BOUNDS; NP PROBLEMS; SEARCH PROBLEM; SPACE USAGE; TIME-SPACE;

ALGORITHMS;

COMPUTATION THEORY;

EID: 77954736320     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806723     Document Type: Conference Paper

References (54)

1. K. Abrahamson, R. G. Downey, and M. R. Fellows. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogs. Annals of Pure and Applied Logic 73:235-276, 1995.
2. S. Arora and B. Barak. Computational Complexity - a modern approach. Cambridge University Press, 2009.
3. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential simulations unless EXPTIME has publishable proofs. Computational Complexity 3:307-318, 1993.
4. B. Barak. A probabilistic-time hierarchy theorem for slightly non-uniform algorithms. In Proc. of RANDOM, 194-208, 2002.
5. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan. Short PCPs verifiable in polylogarithmic time. In Proc. IEEE Conf. on Computational Complexity, 120-134, 2005.
6. S. Bloch, J. F. Buss, and J. Goldsmith. Sharply bounded alternation and quasilinear time. Theory Comput. Syst. 31(2):187-214, 1998.
7. H. Buhrman, L. Fortnow, and T. Thierauf. Nonrelativizing separations. In Proc. IEEE Conf. on Computational Complexity, 8-12, 1998.
8. J. F. Buss and J. Goldsmith. Nondeterminism within P. SIAM J. Computing 22:560-572, 1993.
9. L. Cai and D. Juedes. On the existence of subexponential parameterized algorithms. J. Comput. Syst. Sci. 67(4):789-807, 2003.
10. L. Cai and J. Chen. On the amount of nondeterminism and the power of verifying. SIAM J. Computing 26(3):733-750, 1997.
11. C. Calabro, R. Impagliazzo, and R. Paturi. A duality between clause width and clause density for SAT. In Proc. IEEE Conf. on Computational Complexity, 252-260, 2006.
12. C. Calabro, R. Impagliazzo, and R. Paturi. The complexity of satisfiability of small depth circuits. In Proc. International Workshop on Parameterized and Exact Computation, 2009.
13. Y. Chen and M. Grohe. An isomorphism between subexponential and parameterized complexity theory. SIAM J. Computing 37:1228-1258, 2007.
14. E. Dantsin and E. A. Hirsch. Worst-case upper bounds. In Handbook of Satisfiability, A. Biere, M. Heule, H. van Maaren and T. Walsh (eds.), 341-362, 2008.
15. R. G. Downey and M. R. Fellows. Parameterized complexity. Springer-Verlag, 1999.
16. M. R. Fellows and M. A. Langston. On search, decision and the efficiency of polynomial-time algorithms. In Proc. ACM Symposium on Theory of Computing, 501-512, 1989.
17. 2 n nondeterministic bits. J. Comput. Syst. Sci. 72(1):34-71, 2006.
18. J. Flum and M. Grohe. Parameterized complexity theory. Springer, 2006.
19. L. Fortnow. Comparing notions of full derandomization. In Proc. IEEE Conf. on Computational Complexity, 28-34, 2001.
20. L. Fortnow, R. Lipton, D. van Melkebeek, and A. Viglas. Time-space lower bounds for satisfiability. JACM 52(6):835-865, 2005.
21. 2) problems in computational geometry. Computational Geometry: Theory and Applications 5(3):165-185, 1995.
22. Y. Gurevich and S. Shelah. Nearly linear time. Logic at Botik '89, Springer-Verlag LNCS 363, 108-118, 1989.
23. J. Hartmanis. Gödel, von Neumann, and the P?=NP problem. Bulletin of the European Association for Theoretical Computer Science 101-107, June 1989.
24. See also: M. Sipser. The history and status of the P versus NP question. In Proc. ACM Symposium on Theory of Computing, 603-618, 1992.
25. J. Hastad. The shrinkage exponent of De Morgan formulae is 2. SIAM J. Computing, 27:48-64, 1998.
26. R. Impagliazzo, personal communication.
27. R. Impagliazzo, V. Kabanets, and A. Wigderson. In search of an easy witness: exponential time versus probabilistic polynomial time. J. Comput. Syst. Sci. 65(4):672-694, 2002.
28. R. Impagliazzo and R. Paturi. On the complexity of k-SAT. J. Comput. Syst. Sci. 62(2):367-375, 2001.
29. R. Impagliazzo, R. Paturi, and F. Zane. Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4):512-530, 2001.
30. V. Kabanets and J.-Y. Cai. Circuit minimization problem. In Proc. ACM Symposium on Theory of Computing, 73-79, 2000.
31. V. Kabanets, C. Rackoff, and S. A. Cook. Efficiently approximable real-valued functions. Electronic Colloquium on Computational Complexity, TR00-034, 2000.
32. V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity 13(1-2):1-46, 2004.
33. R. Kannan. Towards separating nondeterminism from determinism. Mathematical Systems Theory 17(1):29-45, 1984.
34. G. Karakostas, R. J. Lipton, and A. Viglas. On the complexity of intersecting finite state automata and NL versus NP. Theor. Comp. Sci. 302(1-3):257-274, 2003.
35. R. M. Karp and R. J. Lipton. Some connections between nonuniform and uniform complexity classes. In Proc. ACM Symposium on Theory of Computing 302-309, 1980.
36. C. M. R. Kintala and P. C. Fisher. Computations with a restricted number of nondeterministic steps (Extended Abstract). In Proc. ACM Symposium on Theory of Computing, 178-185, 1977.
37. A. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Computing 31(5):1501-1526, 2002.
38. D. Kozen. Lower bounds for natural proof systems. In Proc. IEEE Symposium on Foundations of Computer Science, 254-266, 1977.
39. R. J. Lipton. Simulation of nondeterministic machines. Weblog post available at http://rjlipton.wordpress.com/2009/05/11/ simulation-of- nondeterministic-machines/
40. R. J. Lipton. An approach to the P=NP question? Weblog post available at http://rjlipton.wordpress.com/2009/10/02/an-approach-to-the-pnp-question/
41. M. Luby and B. Velickovic. On deterministic approximation of DNF. Algorithmica 16(4/5):415-433, 1996.
42. D. van Melkebeek and R. Santhanam. Holographic proofs and derandomization. SIAM J. Computing, 35:59-90, 2005.
43. D. van Melkebeek. A survey of lower bounds for satisfiability and related problems. Foundations and Trends in Theoretical Computer Science 2:197âǍŞ303, 2007.
44. O. Meir. Combinatorial PCPs with efficient verifiers. In Proc. IEEE Symposium on Foundations of Computer Science, 463-471, 2009.
45. M. Patrascu and R. Williams. On the possibility of faster SAT algorithms. In Proc. ACM-SIAM Symposium on Discrete Algorithms, 2010.
46. N. Pippenger and M. J. Fischer. Relations among complexity measures. JACM 26(2):361-381, 1979.
47. J. Seiferas, M. J. Fischer, and A. Meyer. Separating nondeterministic time complexity Classes. JACM 25:146-167, 1978.
48. I. Tourlakis. Time-space tradeoffs for SAT on nonuniform machines. J. Comput. Syst. Sci. 63(2):268-287, 2001.
49. P. Traxler. The time complexity of constraint satisfaction. In Proc. International Workshop on Parameterized and Exact Computation, 190-201, 2008.
50. G. Tseitin. On the complexity of derivation in propositional calculus. Studies in Constr. Math. and Math. Logic, 1968.
51. R. Williams. Time-space lower bounds for counting NP solutions modulo integers. Computational Complexity 17(2):179-219, 2008.
52. R. Williams. Alternation-trading proofs, linear programming, and lower bounds. In Proc. Symposium on Theoretical Aspects of Computer Science, 2010.
53. S. Zak. A Turing machine hierarchy. Theor. Comp. Sci. 26:327-333, 1983.
54. F. Zane. Circuits, CNFs, and satisfiability. Ph.D. Thesis, University of California at San Diego, 1998.