Fighting perebor: New and improved algorithms for formula and QBF satisfiability

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 183-192

  Santhanam, Rahul ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Average case lower bounds; Quantified boolean formulae; Random restrictions; Satisfiability algorithms

Indexed keywords

DECISION TREES;

DETERMINISTIC ALGORITHMS; FORMULA SIZE LOWER BOUNDS; LOWER BOUNDS; NON-TRIVIAL ALGORITHMS; QUANTIFIED BOOLEAN FORMULAS; RANDOM RESTRICTIONS; SATISFIABILITY ALGORITHMS; SATISFYING ASSIGNMENTS;

BOOLEAN FUNCTIONS;

EID: 78751490067     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.25     Document Type: Conference Paper

References (28)

1. B.A.Subbotovskaya. Realizations of linear functions by formulas using and, or, not. Soviet Mathematics Doklady, (2):110-112, 1961.
2. Chris Calabro, Russell Impagliazzo, and Ramamohan Paturi. The complexity of satisfiability of small depth circuits. In Proceedings of 4th International Workshop on Parameterized and Exact Computation, pages 75-85, 2009.
3. Hana Chockler and Uri Zwick. Which bases admit non-trivial shrinkage of formulae? Computational Complexity, 10(1):28-40, 2001.
4. n algorithm for k-sat based on local search. Theoretical Computer Science, 289(1):69-83, 2002.
5. Evgeny Dantsin and Edward Hirsch. Worst-case upper bounds. In H.van Maaren A.Biere, M.Heule and T.Walsh, editors, Handbook of Satisfiability. 2008.
6. Evgeny Dantsin, Edward Hirsch, Sergei Ivanov, and Maxim Vsemirnov. Algorithms for sat and upper bounds on their complexity. Technical report, Electronic Colloquium on Computational Complexity (ECCC), 8(11), 2001.
7. Alexandra Goultiaeva, Vicki Iverson, and Fahiem Bacchus. Beyond CNF: A circuit-based QBF solver. In Theory and Applications of Satisfiability Testing (SAT 2009), pages 412-426, 2009.
8. Johan Hastad. The shrinkage exponent of de morgan formulas is 2. SIAM Journal on Computing, 27(1):48-64, 1998.
9. Peter Heusch. The complexity of the falsifiability problem for pure implicational formulas. Discrete Applied Mathematics, 96:127-138, 1999. (Pubitemid 129562999)
10. Russell Impagliazzo and Ramamohan Paturi. On the complexity of k-sat. Journal of Computer and System Sciences, 63(4):512-530, 2001.
11. Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. Which problems have strongly exponential complexity? Journal of Computer and System Sciences, 62(4):512-530, 2001.
12. Peter Bro Miltersen, Jaikumar Radhakrishnan, and Ingo Wegener. On converting cnf to dnf. Theoretical Computer Science, 347(1-2):325-335, 2005.
13. n steps. Discrete Applied Mathematics, 10:287-295, 1985.
14. Sharad Malik and Lintao Zhang. Boolean satisfiability from theoretical hardness to practical success. Communications of the ACM, 52(8):76-82, 2009.
15. Noam Nisan and David Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43-52, 1996.
16. Christos Papadimitriou. Computational Complexity. Addison Wesley, 1994.
17. Ramamohan Paturi, Pavel Pudlak, Mike Saks, and Francis Zane. An improved exponential-time algorithm for k-sat. In Proceedings of 39th International Symposium on Foundations of Computer Sciece (FOCS), pages 628-637, 1998.
18. Ramamohan Paturi, Pavel Pudlak, and Francis Zane. Satisfiability coding lemma. In Proceedings of 38th International Symposium on Foundations of Computer Science (FOCS), pages 566-574, 1997.
19. Uwe Schoning. A probabilistic algorithm for k-sat and constraint satisfaction problems. In Proceedings of 40th Annual Symposium on Foundations of Computer Science, pages 410-414, 1999.
20. Christian Thiffault, Fahiem Bacchus, and Toby Walsh. Solving non-clausal formulas with DPLL search. In Tenth International Conference on Principles and Practice of Constraint Programming (CP 2004), pages 663-678, 2004.
21. Boris Trakhtenbrot. A survey of russian approaches to perebor (brute-force search) algorithms. Annals of the History of Computing, 6(4):384-399, 1984.
22. Dieter van Melkebeek and Rahul Santhanam. Holographic proofs and derandomization. SIAM Journal on Computing, 35(1):59-90, 2005.
23. Magnus Wahlstrom. An algorithm for the SAT problem for formulae of linear length. In Proceedings of 13th Annual European Symposium on Algorithms, pages 107-118, 2005.
24. Ryan Williams. Algorithms for quantified boolean formulas. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 299-307, 2002.
25. Ryan Williams. Improving exhaustive search implies superpolynomial lower bounds. In Proceedings of the 42nd Annual ACM Symposium on Theory of Computing, page To Appear, 2010.
26. Gerhard Woeginger. Exact algorithms for NP-hard problems: A survey. In 5th International Workshop on Combinatorial Optimization, pages 185-208, 2001.
27. Gerhard Woeginger. Open problems around exact algorithms. Discrete Applied Mathematics, 156(3):397-405, 2008.
28. Lintao Zhang. Solving QBF by combining conjunctive and disjunctive normal forms. In Proceedings of 21st National Conference on Artificial Intelligence and 18th Innovative Applications of Artificial Intelligence Conference (AAAI 2006), 2006.