Highly Influential

The satissability 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 = M=N xed. For k = 2, this model has been proven to have a sharp threshold at = 1 between formulae which are almost aways… (More)

@inproceedings{Kirkpatrick1994TheSM,
title={The Statistical Mechanics ofk},
author={Scott R. Kirkpatrick},
year={1994}
}