New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
Solving satisfiability in less than 2n steps
Discrete Applied Mathematics
An Analysis of Absorbing Times of Quantum Walks
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Implementation of a Random Walk Method for Solving 3-SAT on Circular DNA Molecules
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Improved upper bounds for 3-SAT
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
ACM SIGACT News
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science
Annals of Mathematics and Artificial Intelligence
An improved deterministic local search algorithm for 3-SAT
Theoretical Computer Science
An improved exponential-time algorithm for k-SAT
Journal of the ACM (JACM)
A new algorithm for optimal 2-constraint satisfaction and its implications
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Theoretical Computer Science
Density condensation of boolean formulas
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Exploiting partial knowledge of satisfying assignments
Discrete Applied Mathematics
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
Journal of Computer and System Sciences
Theoretical advances in artificial immune systems
Theoretical Computer Science
Foundations of r-contiguous matching in negative selection for anomaly detection
Natural Computing: an international journal
Formal Verification of Security Policy Implementations in Enterprise Networks
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
A note on designing logical circuits using SAT
ICES'03 Proceedings of the 5th international conference on Evolvable systems: from biology to hardware
Derandomizing HSSW algorithm for 3-SAT
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Derandomization of schuler’s algorithm for SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Algorithms for satisfiability using independent sets of variables
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Derandomization of PPSZ for unique-k-SAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Algorithmics in exponential time
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Algorithms for the maximum hamming distance problem
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Exploiting independent subformulas: A faster approximation scheme for #k-SAT
Information Processing Letters
| Hi-index | 0.00 |
In [Sch99], Sch枚ning proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly(n) 驴 (4/3)n = O(1.3334n) when given a formula F on n variables. This was the up to now best running time known for an algorithm solving 3-SAT. Here, we describe an algorithm which improves upon this time bound by combining an improved version of the above randomized algorithm with other randomized algorithms. Our new expected time bound for 3-SAT is O(1.3302n).