@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