On the possibility of faster SAT algorithms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1065-1075

  Pǎtraşcu, Mihai ^a   Williams, Ryan ^b  

^a AT AND T LABS RESEARCH   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC PROBLEMS; BOOLEAN CNF FORMULAS; COMPUTATIONALLY EFFICIENT; DISJOINTNESS; DOMINATING SETS; LOWER BOUNDS; SATISFIABILITY; STATE OF THE ART;

ALGORITHMS;

EID: 77951685266     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. Scott Aaronson and Avi Wigderson. Algebrization: A New Barrier in Complexity Theory. Proc. of ACM STOC, 731-740, 2008.
2. Vikraman Arvind and Rainer Schuler. The quantum query complexity of 0-1 knapsack and associated claw problems. In Proc. of International Symposium on Algorithms and Computation (ISAAC), Springer-Verlag LNCS:168-177, 2003. (Pubitemid 137629248)
3. Bengt Aspvall, Michael F. Plass, and Robert E. Tarjan. A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Proc. Letters 8(3):121-123, 1979.
4. Chris Calabro, Russell Impagliazzo, and Ramamohan Paturi. A Duality between Clause Width and Clause Density for SAT. In Proc. IEEE Conference on Computational Complexity, 252-260, 2006.
5. Arkadev Chattopadhyay and Anil Ada. Multiparty Communication Complexity of Disjointness. ECCC Report TR08-002, 2008.
6. Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, and Ge Xia. Strong computational lower bounds via parameterized complexity. J. Computer and System Sciences 72:1346-1367, 2006. (Pubitemid 44647246)
7. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Cliff Stein. Introduction to Algorithms, 2nd Edition, MIT Press, 2001.
8. Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Computation 9:251-280, 1990.
9. Don Coppersmith. Rectangular Matrix Multiplication Revisited. J. Complexity 13:42-49.
10. Evgeny Dantsin, Edward A. Hirsch, and Alexander Wolpert. Algorithms for SAT based on search in Hamming balls. In Proc. Symposium on Theor. Aspects of Comput. Sci. (STACS), Springer-Verlag LNCS 2996, 141-151, 2004.
11. Evgeny Dantsin and Alexander Wolpert. Derandomization of Schuler's Algorithm for SAT. In Proc. Int. Conf. on Theory and Applications of Satisfiability Testing (SAT), Springer-Verlag LNCS 3542, 80-88, 2005.
12. Evgeny Dantsin and Alexander Wolpert. An improved upper bound for SAT. In Proc. Int. Conf. on Theory and Applications on Satisfiability Testing (SAT), Springer-Verlag LNCS 3569, 400-407, 2005.
13. Evgeny Dantsin, Edward A. Hirsch, and Alexander Wolpert. Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. Electronic Colloquium on Computational Complexity, Report 102, 2005.
14. Evgeny Dantsin and Edward A. Hirsch. Worst-Case Upper Bounds. In Handbook of Satisfiability, Armin Biere, Marijn Heule, Hans van Maaren and Toby Walsch (eds.), 341-362, 2008.
15. William F. Dowling and Jean H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Programming 1(3):267-284, 1984.
16. Rodney G. Downey and Michael R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
17. Friedrich Eisenbrand and Fabrizio Grandoni. On the Complexity of Fixed Parameter Clique and Dominating Set. Theor. Comput. Sci. 326(1-3):57-67, 2004.
18. Uriel Feige and Joe Kilian. On Limited versus Polynomial Nondeterminism. Chicago J. Theor. Comput. Sci., 1997.
19. 2) problems in computational geometry. Computational Geometry: Theory and Applications 5(3): 165-185, 1995.
20. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
21. Martin Grohe. The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side. In Proc. IEEE Symposium on Foundations of Computer Science (FOCS), 552-561, 2003.
22. Vince Grolmusz. The BNS lower bound for multi-party protocols is nearly optimal. Information and computation 112(1):51-54, 1994.
23. Russell Impagliazzo and Ramamohan Paturi. On the Complexity of k-SAT. J. Comput. Syst. Sci. 62(2):367-375, 2001.
24. Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. Which Problems Have Strongly Exponential Complexity? J. Comput. Syst. Sci. 63(4): 512-530, 2001.
25. Troy Lee and Adi Shraibman. Disjointness is hard in the multi-party number-on-the-forehead model. In Proc. IEEE Conference on Computational Complexity, 309-336, 2009.
26. Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman, and Lidror Troyansky. 2+p-SAT: Relation of Typical-Case Complexity to the Nature of the Phase Transition. Random Structures and Algorithms 15:414-440, 1999.
27. Jaroslav Nesetril and Svatopluk Poljak. On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae, 26(2): 415-419, 1985.
28. Pavel Pudlak. Satisfiability - algorithms and logic. In Proc. Int. Symp. on Mathematical Foundations of Computer Science (MFCS'98), Springer-Verlag LNCS 1450, 129-141, 1998.
29. International Conference on Theory and Applications of Satisfiability Testing. See http://www.satisfiability.org/
30. Rainer Schuler. An algorithm for the satisfiability problem of formulas in conjunctive normal form. J. Algorithms 54(1):40-44, 2005.
31. Gerhard J. Woeginger. Exact algorithms for NP-hard problems: A survey. In Combinatorial Optimization - Eureka! You shrink!, Springer-Verlag LNCS 2570, 185-207, 2003.
32. Gerhard J. Woeginger. Space and time complexity of exact algorithms: some open problems. In Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC), Springer-Verlag LNCS 3162, 281-290, 2004. (Pubitemid 39744008)
33. Ryan Williams, Carla Gomes, and Bart Selman. Back-doors to typical case complexity. In Proc. International Joint Conference on Artificial Intelligence (IJCAI), 2003.
34. R. Ryan Williams. Algorithms and resource requirements for fundamental problems. PhD Thesis, Carnegie Mellon University, Pittsburgh, PA, 2007.