A new algorithm for optimal constraint satisfaction and its implications

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

Volumn 3142, Issue , 2004, Pages 1227-1237

  Williams, Ryan ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT SATISFACTION PROBLEMS; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION;

CONSTANT FACTORS; GENERAL CONSTRAINTS; HIGH-DIMENSIONAL; HIGH-DIMENSIONAL PROBLEMS; MATRIX MULTIPLICATION; OPTIMAL CONSTRAINT; POLYNOMIAL FACTOR; POLYNOMIAL-TIME;

OPTIMIZATION;

EID: 35048818030     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_101     Document Type: Article

References (30)

1. J. Alber, J. Gramm, and R. Niedermeier. Faster exact algorithms for hard problems: a parameterized point of view. Discrete Mathematics 229:3-27, Elsevier, 2001.
2. N. Alon and M. Naor. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16:434-449, 1996.
3. N. Bansal and V. Raman. Upper bounds for Max-Sat: Further Improved. In Proceedings of ISAAC, Springer LNCS 1741:247-258, 1999.
4. M. Charikar, P. Indyk, and R. Panigrahy. New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. In Proceedings of ICALP, Springer LNCS 2380:451-462, 2002.
5. J. Chen and I. Kanj. Improved Exact Algorithms for MAX-SAT. In Proceedings of LATIN, Springer LNCS 2286:341-355, 2002.
6. D. Coppersmith and S. Winograd. Matrix Multiplication via Arithmetic Progressions. JSC 9(3):251-280, 1990.
7. J. Gramm and R. Niedermeier. Faster exact solutions for Max2Sat. In Proceedings of CIAC, Springer LNCS 1767:174-186, 2000.
8. J. Gramm, E.A. Hirsch, R. Niedermeier and P. Rossmanith. Worst-case upper bounds for MAX-2-SAT with application to MAX-CUT. Discrete Applied Mathematics 130(2):139-155, 2003.
9. 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, 2001.
10. E. A. Hirsch, Worst-case study of local search for MAX-k-SAT. Discrete Applied Mathematics 130(2): 173-184, 2003.
11. m/4-time Algorithm for MAX-2-SAT: Corrected Version. Electronic Colloquium on Computational Complexity Report TR99-036, 2000.
12. T. Hofmeister, U. Schöning, R. Schuler, O. Watanabe. A probabilistic 3-SAT algorithm further improved. In Proceedings of STAGS, Springer LNCS 2285:192-202, 2002.
13. E. Horowitz and S. Sahni. Computing partitions with applications to the knapsack problem. JACM 21:277-292, 1974.
14. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM J. Computing, 7(4): 413-423, 1978.
15. |E|/4-time Algorithm for MAX-CUT. Zapiski nauchnyh seminarov POMI No.293, 129-138, 2002.
16. M. Mahajan and V. Raman. Parameterizing above Guaranteed Values: MAXSAT and MAXCUT. J. Algorithms 31(2): 335-354, 1999.
17. J. Nesetril and S. Poljak. On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae, 26(2): 415-419, 1985.
18. R. Niedermeier and P. Rossmanith. New upper bounds for maximum satisfiability. J. Algorithms 26:63-88, 2000.
19. R. Paturi, P. Pudlak, M. E. Saks, and F. Zane. An improved exponential-time algorithm for k-SAT. In Proceedings of the 39th IEEE FOCS, 628-637, 1998.
20. V. Raman, B. Ravikumar, and S. Srinivasa Rao. A Simplified NP-Complete MAXSAT problem. Information Processing Letters 65:1-6, 1998.
21. R. Rivest. Partial match retrieval algorithms. SIAM J. on Computing, 5:19-50, 1976.
22. M. Robson. Algorithms for maximum independent sets. J. Algorithms, 7(3):425-440, 1986.
23. F. Ruskey. Simple combinatorial Gray codes constructed by reversing sublists. In Proceedings of International Symposium on Algorithms and Computation, Springer LNCS 762:201-208, 1993.
24. U. Schöning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proceedings of the 40th IEEE FOCS, 410-414, 1999.
25. n/4) Algorithm for Certain NP-Complete Problems. SMAM J. Comput. 10(3): 456-464, 1981.
26. R. Schuler. An algorithm for the satisfiability problem of formulas in conjunctive normal form. Accepted in J. Algorithms, 2003.
27. A. Scott and G. Sorkin. Easter Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances. In Proceedings of RANDOM-APPROX 2003, Springer LNCS 2764:382-395, 2003.
28. R. Williams. A new algorithm for optimal constraint satisfaction and its implications. Electronic Colloquium on Computational Complexity, Report TR04-032, 2004.
29. G.J. Woeginger. Exact algorithms for NP-hard problems: A survey. In Combinatorial Optimization - Eureka! You shrink!, Springer LNCS 2570:185-207, 2003.
30. U. Zwick. All Pairs Shortest Paths using bridging sets and rectangular matrix multiplication. JACM 49(3):289-317, May 2002.