On the approximation of maximum satisfiability
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A simplified NP-complete MAXSAT problem
Information Processing Letters
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Improved approximation algorithms for MAX SAT
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A machine program for theorem-proving
Communications of the ACM
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
Upper Bounds for MaxSat: Further Improved
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An Improved Exponential-Time Algorithm for k-SAT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Solving satisfiability in less than 2n steps
Discrete Applied Mathematics
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
Faster Exact Solutions for MAX2SAT
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
A tighter upper bound for random MAX 2-SAT
Information Processing Letters
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
Journal of Computer and System Sciences
Linear-programming design and analysis of fast algorithms for Max 2-CSP
Discrete Optimization
| Hi-index | 0.00 |
Recently there was a significant progress in proving (exponential-time) worst-case upper bounds for the propositional satisfiability problem (SAT) and related problems. In particular, for MAX-2-SAT Niedermeier and Rossmanith recently presented an algorithm with worstcase upper bound O(K ċ2K/2.88...), and the bound O(K ċ2K/3.44...) is implicit from the paper by Bansal and Raman (K is the number of clauses). In this paper we improve this bound to p(K)2K2/4, where K2 is the number of 2-clauses, and p is a polynomial. In addition, our algorithm and the proof are much simpler than the previous ones. The key ideas are to use the symmetric flow algorithm of Yannakakis and to count only 2-clauses (and not 1-clauses).