SAT Local Search Algorithms: Worst-Case Study
Author:
- Edward A. HirschEHEdward A. Hirsch
- 1 February 2000
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 24 (1-2) , 127-143
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An improved exponential-time algorithm for k-SAT2002
- New methods for 3-SAT decision and worst-case analysisTheoretical Computer Science, 1999
- Approximating the unsatisfiability threshold of random formulasRandom Structures & Algorithms, 1998
- Local search algorithms for SAT: Worst-case analysis1998
- Analysis of Two Simple Heuristics on a Random Instance ofk-satJournal of Algorithms, 1996
- Average time complexity of the SAT 1.2 algorithm1994
- 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
- On the lengths of proofs in the propositional calculus (Preliminary Version)1974