On selecting a satisfying truth assignment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical 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
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)
Guided search and a faster deterministic algorithm for 3-SAT
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing
Derandomization of PPSZ for unique-k-SAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
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
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
An exact exponential time algorithm for counting bipartite cliques
Information Processing Letters
Exploiting independent subformulas: A faster approximation scheme for #k-SAT
Information Processing Letters
| Hi-index | 0.00 |
Schoening in 1999 presented a simple randomized algorithm for k-SAT with running time an * poly(n) for a = 2(k-1)/k. We give a deterministic version of this algorithm running in time an+o(n).