A lower bound for DLL algorithms for k-SAT (preliminary version)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Algorithms for quantified Boolean formulas
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
New Algorithms for k -SAT Based on the Local Search Principle
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
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
Exploiting Partial Knowledge of Satisfying Assignments
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
A Space-Efficient Randomized DNA Algorithm for k-SAT
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
How efficiently can room at the bottom be traded away for speed at the top?
Natural Computing: an international journal
Improved upper bounds for 3-SAT
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Journal of Algorithms
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
An improved exponential-time algorithm for k-SAT
Journal of the ACM (JACM)
On quantum versions of record-breaking algorithms for SAT
ACM SIGACT News
Proceedings of the 2006 ACM symposium on Applied computing
The complexity of depth-3 circuits computing symmetric Boolean functions
Information Processing Letters
Combinatorics, Probability and Computing
Discrete Applied Mathematics
Exploiting partial knowledge of satisfying assignments
Discrete Applied Mathematics
Satisfiability certificates verifiable in subexponential time
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Derandomizing HSSW algorithm for 3-SAT
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
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
Algorithms for satisfiability using independent sets of variables
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Substitutional definition of satisfiability in classical propositional logic
SAT'05 Proceedings of the 8th 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
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
Algorithmics in exponential time
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The leakage-resilience limit of a computational problem is equal to its unpredictability entropy
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Efficient 3-SAT algorithms in the tile assembly model
Natural Computing: an international journal
On the limits of sparsification
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Strong ETH holds for regular resolution
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We present and analyze two simple algorithms for finding satisfying assignments of /spl kappa/-CNFs (Boolean formulae in conjunctive normal form with at most /spl kappa/ literals per clause). The first is a randomized algorithm which, with probability approaching 1, finds a satisfying assignment of a satisfiable /spl kappa/-CNF formula F in time O(n/sup 2/|F|2/sup n-n//spl kappa//). The second algorithm is deterministic, and its running time approaches 2/sup n-n/2/spl kappa// for large n and /spl kappa/. The randomized algorithm is the best known algorithm for /spl kappa/3; the deterministic algorithm is the best known deterministic algorithm for /spl kappa/4. We also show an /spl Omega/(n/sup 1/4/2/sup /spl radic/n/) lower bound on the size of depth 3 circuits of AND and OR gates computing the parity function. This bound is tight up to a constant factor. The key idea used in these upper and lower bounds is what we call the Satisfiability Coding Lemma. This basic lemma shows how to encode satisfying solutions of a /spl kappa/-CNF succinctly.