A lower bound for DLL algorithms for k-SAT (preliminary version)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
Satisfiability - Algorithms and Logic
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On quantum versions of record-breaking algorithms for SAT
ACM SIGACT News
A new algorithm for optimal 2-constraint satisfaction and its implications
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
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
Satisfiability certificates verifiable in subexponential time
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
A satisfiability algorithm for AC0
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Derandomization of schuler’s algorithm for SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
An algorithm for the SAT problem for formulae of linear length
ESA'05 Proceedings of the 13th annual European conference on Algorithms
An improved Õ(1.234m)-time deterministic algorithm for SAT
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Faster exact solving of SAT formulae with a low number of occurrences per variable
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
An improved upper bound for SAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the limits of sparsification
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We consider the satisfiability problem on Boolean formulas in conjunctive normal form. We show that a satisfying assignment of a formula can be found in polynomial time with a success probability of 2-n(1-1/(1+logm)), where n and m are the number of variables and the number of clauses of the formula, respectively. If the number of clauses of the formulas is bounded by nc for some constant c, this gives an expected run time of O(p(n).2n(1-1/(1+clogn))) for a polynomial p.