New worst-case upper bounds for SAT

Journal of Automated Reasoning

Volumn 24, Issue 4, 2000, Pages 397-420

  Hirsch, Edward A ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; THEOREM PROVING;

LOCAL SEARCH METHOD; SATISFIABILITY OF PROPORTIONAL FORMULA; SPLITTING METHOD; WORST CASE UPPER BOUND;

ARTIFICIAL INTELLIGENCE;

EID: 0033687739     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1006340920104     Document Type: Article

References (32)

1. Bansal, N. and Raman, V.: Upper bounds for MaxSat: Further improved, in Proceedings of ISAAC'99. To appear.
2. Dantsin, E.: Tautology proof systems based on the splitting method, Leningrad Division of Steklov Institute of Mathematics (LOMI), Ph.D. Dissertation, Leningrad, 1982 (in Russian).
3. n satisfiability algorithm extended to the case when almost all clauses are short, Computer Science Department, University of Texas at El Paso, UTEP-CS-91-5, 1991.
4. Dantsin, E., Gavrilovich, M., Hirsch, E. A. and Konev, B.: Approximation algorithms for Max Sat: A better performance ratio at the cost of a longer running time, PDMI Preprint 14/1998, available from ftp://ftp.pdmi.ras.ru/pub/publicat/preprint/1998/14-98.ps
5. Dantsin, E. Ya. and Kreinovich, V. Ya.: Exponential upper bounds for the satisfiability problem, in Proc. of the IX USSR Conf. on Math. Logic, Leningrad, 1988 (in Russian).
6. Davis, M., Logemann, G. and Loveland, D.: A machine program for theorem-proving, Comm. ACM 5 (1962), 394-397.
7. Davis, M. and Putnam, H.: A computing procedure for quantification theory, J. ACM 7 (1960), 201-215.
8. Gu, J., Purdom, P. W., Franco, J. and Wah, B. W.: Algorithms for Satisfiability (SAT) Problem: A Survey, Discrete Math, and Theoret. Comput. Sci.: Satisfiability (SAT) Problem, Amer. Math. Soc., 1997.
9. Hirsch, E. A.: Separating the signs in the satisfiability problem, Zap. Nauchn. Sem. POMI, 241 (1997), 30-71 (in Russian). English translation of this collection is to appear in the J. Math. Sci., 1999.
10. Hirsch, E. A.: Separating the signs in the satisfiability problem, Zap. Nauchn. Sem. POMI, 241 (1997), 30-71 (in Russian). English translation of this collection is to appear in the J. Math. Sci., 1999.
11. Hirsch, E. A.: Two new upper bounds for SAT, in Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 521-530.
12. Hirsch, E. A.: Local search algorithms for SAT: Worst-case analysis, in Proc. of the 6th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Comput. Sci. 1432, 1998, pp. 246-254.
13. Hirsch, E. A.: Hard formulas for SAT local search algorithms, PDMI Preprint 19/1998, available from ftp://ftp.pdmi.ras.ru/pub/publicat/preprint/19-98.ps.
14. Hirsch, E. A.: SAT local search algorithms: Worst-case study, J. Automated Reasoning special issue "SAT-2000" 24(1-2) (2000).
15. Hirsch, E. A.: A new algorithm for MAX-2-SAT, Technical Report TR99-036, Electronic Colloquium on Computational Complexity, 1999.
16. Kullmann, O.: Worst-case analysis, 3-SAT decision and lower bounds: Approaches for improved SAT algorithms, in DIMACS Proc. SAT Workshop 1996, Amer. Math. Soc., 1996, pp. 261-313.
17. Kullmann, O.: New methods for 3-SAT decision and worst-case analysis, Theoret. Comput. Sci. 223(1-2) (1999), 1-72.
18. Kullmann, O.: Investigations on autark assignments, Submitted to Discrete Appl. Math., 1998, 19 pages.
19. Kullmann, O. and Luckhardt, H.: Deciding propositional tautologies: Algorithms and their complexity, Preprint, 1997, 82 pages; the ps file can be obtained at http://mi.informatik.uni-frankfurt.de/people/kullmann/kullmann.html. A journal version, Algorithms for SAT/TAUT decision based on various measures, is to appear in Inform, and Comput., 1998.
20. Luckhardt, H.: Obere Komplexitätsschranken für TAUT-Entscheidüngen, in Proc. Frege Conference 1984, Schwerine, Akademie-Verlag, Berlin, pp. 331-337.
21. Mahajan, M. and Raman, V.: Parametrizing above guaranteed values: MaxSat and MaxCut, Technical Report TR97-033, Electronic Colloquium on Computational Complexity, 1997. To appear in J. Algorithms.
22. Niedermeier, R. and Rossmanith, P.: New upper bounds for MaxSat, Technical Report KAM-DIMATIA Series 98-401, Charles University, Praha, Faculty of Mathematics and Physics, July 1998. Extended abstract appeared in Proceedings of the 26th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 1644, 1999, pp. 575-584.
23. r) steps, Bericht Nr. 3/1979, Reihe Theoretische Informatik, Universität-Gesamthochschule-Paderborn.
24. Monien, B. and Speckenmeyer, E.: Upper bounds for covering problems, Bericht Nr. 7/1980, Reihe Theoretische Informatik, Universität-Gesamthochschule-Paderborn.
25. n steps, Discrete Appl. Math. 10 (1985), 287-295.
26. Paturi, R., Pudlak, P. and Zane, F.: Satisfiability coding lemma, in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997, pp. 566-574.
27. Paturi, R., Pudlak, P., Saks, M. E. and Zane, F.: An improved exponential-time algorithm for k-SAT, in Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998, pp. 628-637.
28. n steps, in Lecture Notes in Comput. Sci. 702, 1993, pp. 379-394.
29. n) 3-satisfiability algorithm, Workshop on the Satisfiability Problem, Technical Report, Siena, 29 April-3 May, 1996; University Köln, Report No. 96-230.
30. Schöning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999. To appear.
31. Urquhart, A.: The complexity of propositional proofs, Bull. Symbolic Logic 1(4) (1995), 425-467.
32. Van Gelder, A.: A satisfiability tester for non-clausal propositional calculus, Inform. and Comput. 79 (1988), 1-21.