A Theoretical Analysis of the k-Satisfiability Search Space

@inproceedings{Sutton2009ATA,
  title={A Theoretical Analysis of the k-Satisfiability Search Space},
  author={Andrew M. Sutton and Adele E. Howe and L. Darrell Whitley},
  booktitle={SLS},
  year={2009}
}
Local search algorithms perform surprisingly well on the ksatisfiability (k-SAT) problem. However, few theoretical analyses of the k-SAT search space exist. In this paper we study the search space of the k-SAT problem and show that it can be analyzed by a decomposition. In particular, we prove that the objective function can be represented as a superposition of exactly k elementary landscapes. We show that this decomposition allows us to immediately compute the expectation of the objective… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Landscapes and their correlation functions

P. F. Stadler
J. of Mathematical Chemistry 20, 1–45 • 1996
View 1 Excerpt

Toward a theory of landscapes

P. F. Stadler
Lopéz-Peña, R., Capovilla, R., Garćıa-Pelayo, R., Waelbroeck, H., Zertruche, F. (eds.) Complex Systems and Binary Networks, pp. 77–163. Springer, Heidelberg • 1995
View 3 Excerpts

Similar Papers

Loading similar papers…