A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
Satisfiability - Algorithms and Logic
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
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
Improved upper bounds for 3-SAT
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Journal of Algorithms
An improved deterministic local search algorithm for 3-SAT
Theoretical Computer Science
Derandomization of schuler’s algorithm for SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
On quantum versions of record-breaking algorithms for SAT
ACM SIGACT News
Proceedings of the 2006 ACM symposium on Applied computing
On the possibility of faster SAT algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1/α) up to a polynomial factor, where α = ln (m/n) + O(ln ln m) and n, m are respectively the number of variables and the number of clauses in the input formula. This bound is asymptotically better than the previously best known 2n(1−1/log(2m)) bound for SAT.