MAX-SAT for formulas with constant clause density can be solved faster than in Ο(2n) time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4121 LNCS, Issue , 2006, Pages 266-276

  Dantsin, Evgeny ^a   Wolpert, Alexander ^a  

^a ROOSEVELT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTION EVALUATION; NUMERICAL METHODS; OPTIMIZATION;

CONSTANT CLAUSE DENSITY; DETERMINISTIC ALGORITHMS; K-CNF FORMULAS;

PROBLEM SOLVING;

EID: 33749557939     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814948_26     Document Type: Conference Paper

References (14)

1. V. Arvind and R. Schuler. The quantum query complexity of 0-1 knapsack and associated claw problems. In Proceedings of the 14th Annual International Symposium on Algorithms and Computation, ISAAC 2003, volume 2906 of Lecture Notes in Computer Science, pages 168-177. Springer, December 2003.
2. N. Bansal and V. Raman. Upper bounds for MaxSat: Further improved. In Proceedings of the 14th Annual International Symposium on Algorithms and Computation, ISAAC'99, volume 1741 of Lecture Notes in Computer Science, pages 247-258. Springer, December 1999.
3. P. Beame, R. Impagliazzo, T. Pitassi, and N. Segerlind. Memoization and DPLL: Formula caching proof systems. In Proceedings of the 18th Annual IEEE Conference on Computational Complexity, CCC 2003, pages 225-236, 2003.
4. L. Cai and J. Chen. On fixed-parameter tractability and approximability of NP optimization problems. Journal of Computer and System Sciences, 54(3):465-474, 1997.
5. J. Chen and I. Kanj. Improved exact algorithm for Max-Sat. Discrete Applied Mathematics, 142(1-3):17-27, August 2004.
6. E. Dantsin, M. Gavrilovich, E. A. Hirsch, and B. Konev. MAX SAT approximation beyond the limits of polynomial-time approximation. Annals of Pure and Applied Logic, 113(1-3):81-94, December 2001.
7. R. Graham, D. Knuth, and O. Patashnik. Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, 2nd edition, 1994.
8. E. A. Hirsch. Worst-case study of local search for MAX-k-SAT. Discrete Applied Mathematics, 130(2):173-184, 2003.
9. H. Karloff and U. Zwick. A 7/8-approximation algorithm for MAX 3SAT? In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97, pages 406-415, 1997.
10. M. Mahajan and V. Raman. Parameterizing above guaranteed values: Maxsat and maxcut: An algorithm for the satisfiability problem of formulas in conjunctive normal form. Journal of Algorithms, 31(2):335-354, 1999.
11. B. Monien and E. Speckenmeyer. Upper bounds for covering problems. Technical Report Bericht Nr. 7/1980, Reihe Theoretische Informatik, Universität-Gesamthochschule-Paderborn, 1980.
12. R. Niedermeier and P. Rossmanith. New upper bounds for maximum satisfiability. Journal of Algorithms, 36(1):63-88, July 2000.
13. R. Williams. On computing k-CNF formula properties. In Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing, SAT 2003, volume 2919 of Lecture Notes in Computer Science, pages 330-340. Springer, May 2003.
14. H. Zhang, H. Shen, and F. Manyà. Exact algorithms for MAX-SAT. Electronic Notes in Theoretical Computer Science, 86(1), May 2003.