On the greedy algorithm for satisfiability
Information Processing Letters
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
Approximating the unsatisfiability threshold of random formulas
Random Structures & Algorithms
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Typical random 3-SAT formulae and the satisfiability threshold
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
Local Search Algorithms for SAT: Worst-Case Analysis
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Average Time Complexity of the SAT 1.2 Algorithm
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
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
On the lengths of proofs in the propositional calculus (Preliminary Version)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Evidence for invariants in local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
Scaling Properties of Pure Random Walk on Random 3-SAT
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
The Complexity of Boolean Constraint Satisfaction Local Search Problems
Annals of Mathematics and Artificial Intelligence
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
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
Journal of Automated Reasoning
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
A Theoretical Analysis of Search in GSAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Experimental study of the shortest reset word of random automat
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
On the hardness of losing weight
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
Recent experiments demonstrated that local search algorithms (e.g. GSAT) are able to find satisfying assignments for many “hard” Boolean formulas. A wide experimental study of these algorithms demonstrated their good performance on some inportant classes of formulas as well as poor performance on some other ones. In contrast, theoretical knowledge of their worst-case behavior is very limited. However, many worst-case upper and lower bounds of the form 2α in (αlinear-size formulas we consider for the upper bound covers most of the DIMACS benchmarks; the satisfiability problem for this class of formulas is NP-complete.