A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search
Top Cited Papers
- 23 October 2002
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 289 (1), 69-83
- https://doi.org/10.1016/s0304-3975(01)00174-8
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On selecting a satisfying truth assignmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Satisfiability Coding LemmaPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- New methods for 3-SAT decision and worst-case analysisTheoretical Computer Science, 1999
- Worst-case analysis, 3-SAT decision, and lower bounds: Approaches for improved SAT algorithmsPublished by American Mathematical Society (AMS) ,1997
- Number of models and satisfiability of sets of clausesTheoretical Computer Science, 1996
- Average time complexity of the SAT 1.2 algorithmLecture Notes in Computer Science, 1994
- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problemsArtificial Intelligence, 1992
- On the greedy algorithm for satisfiabilityInformation Processing Letters, 1992
- Solving satisfiability in less than 2n stepsDiscrete Applied Mathematics, 1985
- Two systems for proving tautologies, based on the split methodJournal of Mathematical Sciences, 1983