A new algorithm for optimal 2-constraint satisfaction and its implications

@article{Williams2005ANA,
  title={A new algorithm for optimal 2-constraint satisfaction and its implications},
  author={R. Williams},
  journal={Theor. Comput. Sci.},
  year={2005},
  volume={348},
  pages={357-365}
}
  • R. Williams
  • Published 2005
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • We present a novel method for exactly solving (in fact, counting solutions to) general constraint satisfaction optimization with at most two variables per constraint (e.g. MAX-2-CSP and MIN-2-CSP), which gives the first exponential improvement over the trivial algorithm. More precisely, the runtime bound is a constant factor improvement in the base of the exponent: the algorithm can count the number of optima in MAX-2-SAT and MAX-CUT instances in O(m32ωn/3) time, where ω < 2.376 is the matrix… CONTINUE READING
    352 Citations
    Optimal 2-constraint satisfaction via sum-product algorithms
    • M. Koivisto
    • Mathematics, Computer Science
    • Inf. Process. Lett.
    • 2006
    • 17
    • PDF
    New exact algorithms for the 2-constraint satisfaction problem
    • 13
    • PDF
    A faster polynomial-space algorithm for Max 2-CSP
    • K. Edwards
    • Computer Science, Mathematics
    • J. Comput. Syst. Sci.
    • 2016
    • 3
    • PDF
    Solving MAX-r-SAT Above a Tight Lower Bound
    • 118
    • PDF
    A new upper bound for Max-2-SAT: A graph-theoretic approach
    • 4
    A new upper bound for (n, 3)-MAX-SAT
    • 8
    A new approach to proving upper bounds for MAX-2-SAT
    • 41
    • PDF
    Exact Max 2-Sat: Easier and Faster
    • 12
    • PDF

    References

    SHOWING 1-10 OF 55 REFERENCES
    A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
    • 156
    • PDF
    Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
    • 74
    • PDF
    Improved Exact Algorithms for MAX-SAT
    • 57
    • PDF
    New Upper Bounds for Maximum Satisfiability
    • 97
    • PDF
    An improved exponential-time algorithm for k-SAT
    • 233
    • PDF
    Which Problems Have Strongly Exponential Complexity
    • 672
    • Highly Influential
    MAX SAT approximation beyond the limits of polynomial-time approximation
    • 35
    • PDF
    Upper Bounds for MaxSat: Further Improved
    • 88
    On Computing k-CNF Formula Properties
    • 13
    • PDF
    Faster Exact Solutions for MAX2SAT
    • 32