Some heuristic analysis of local search algorithms for SAT problems

Authors:
Osamu Watanabe
Affiliations:
Department of Mathematical and Computing Science, Tokyo Institute of Technology, Tokyo, Japan
Venue:
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Year:
2005

Citing 2
Cited 0

Lower bounds for random 3-SAT via differential equations

Theoretical Computer Science - Phase transitions in combinatorial problems
Expander codes

IEEE Transactions on Information Theory - Part 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

By using heuristic analysis proposed in [WSA03], we investigate the dynamical behavior of greedy local search algorithms for satisfiability (SAT) problems. We observe that the difference between hard and easy instances is relatively small while there are enough places to be improved locally, and that the difference becomes crucial when all such places are processed. We also show that a tabu search type restriction could be useful for improving the efficiency of greedy local search algorithms.