A new algorithm for optimal constraint satisfaction and its implications

[1]  Alon Itai,et al.  Finding a Minimum Circuit in a Graph , 1978, SIAM J. Comput..

[2]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[3]  Svatopluk Poljak,et al.  On the complexity of the subgraph problem , 1985 .

[4]  Osamu Watanabe,et al.  A Probabilistic 3-SAT Algorithm Further Improved , 2002, STACS.

[5]  Jianer Chen,et al.  Improved exact algorithms for MAX-SAT , 2002, Discret. Appl. Math..

[6]  Rolf Niedermeier,et al.  Faster Exact Solutions for MAX2SAT , 2000, CIAC.

[7]  Alex D. Scott,et al.  Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances , 2003, RANDOM-APPROX.

[8]  Rolf Niedermeier,et al.  Faster exact algorithms for hard problems: A parameterized point of view , 2001, Discret. Math..

[9]  Gerhard J. Woeginger,et al.  Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.

[10]  John Michael Robson,et al.  Algorithms for Maximum Independent Sets , 1986, J. Algorithms.

[11]  S. Srinivasa Rao,et al.  A Simplified NP-Complete MAXSAT Problem , 1998, Inf. Process. Lett..

[12]  Piotr Indyk,et al.  New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems , 2002, ICALP.

[13]  Rainer Schuler,et al.  An algorithm for the satisfiability problem of formulas in conjunctive normal form , 2005, J. Algorithms.

[14]  Michael E. Saks,et al.  An improved exponential-time algorithm for k-SAT , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[15]  Ellis Horowitz,et al.  Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.

[16]  Noga Alon,et al.  Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions , 1994, Algorithmica.

[17]  Frank Ruskey,et al.  Simple Combinatorial Gray Codes Constructed by Reversing Sublists , 1993, ISAAC.

[18]  Boris Konev,et al.  MAX SAT approximation beyond the limits of polynomial-time approximation , 2001, Ann. Pure Appl. Log..

[19]  Rolf Niedermeier,et al.  New Upper Bounds for Maximum Satisfiability , 2000, J. Algorithms.

[20]  Edward A. Hirsch,et al.  Worst-case study of local search for MAX-k-SAT , 2003, Discret. Appl. Math..

[21]  U. Schöning.  A probabilistic algorithm for k-SAT and constraint satisfaction problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[22]  Uri Zwick,et al.  All pairs shortest paths using bridging sets and rectangular matrix multiplication , 2000, JACM.

[23]  Meena Mahajan,et al.  Parametrizing Above Guaranteed Values: MaxSat and MaxCut , 1997, Electron. Colloquium Comput. Complex..

[24]  Ronald L. Rivest,et al.  Partial-Match Retrieval Algorithms , 1976, SIAM J. Comput..