The Statistical Mechanics of k-Satisfaction

@inproceedings{Kirkpatrick1993TheSM,
  title={The Statistical Mechanics of k-Satisfaction},
  author={Scott Kirkpatrick and G{\'e}za Gy{\"o}rgyi and Naftali Tishby and Lidror Troyansky},
  booktitle={NIPS},
  year={1993}
}
The satisfiability of random CNF formulae with precisely k variables per clause ("k-SAT") is a popular testbed for the performance of search algorithms. Formulae have M clauses from N variables, randomly negated, keeping the ratio a = M / N fixed . For k = 2, this model has been proven to have a sharp threshold at a = 1 between formulae which are almost aways satisfiable and formulae which are almost never satisfiable as N --jo 00 . Computer experiments for k = 2, 3, 4, 5 and 6, (carried out in… CONTINUE READING
7 Citations
14 References
Similar Papers

References

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

Evidence for a Satisfiability Threshold for Random 3CNF Formulas

  • T. Larrabee, Y. Tsuji
  • Proc. of the AAAI Spring Symposium on AI and NP…
  • 1993

Experimental Results on the Crossover Point in Satisfiability Problems

  • J. M. Crawford, Auton L.D.
  • Proc. of AAAI-99, 1993.
  • 1993

Introduction to Percolation

  • D. Stauffer, A. Aharony
  • Theory. London: Taylor and Francis,
  • 1992

Commun

  • V. E. Barker, D. O'Connor
  • Assoc. for Computing Machinery, 32(3), 1989, 298…
  • 1989

The Uses and Abuses of Statistical Mechanics in Computational Complexity

  • Y. Fu
  • Lectures in the Sciences of Complexity, ed. D…
  • 1989
1 Excerpt

Similar Papers

Loading similar papers…