TY  - RPRT
TI  - Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satisfiability problem, and its application to stop-and-restart resolutions.
AU  - Simona Cocco
AU  - Rémi Monasson
PY  - 2002
DO  - 10.1103/physreve.66.037101
UR  - https://pubmed.ncbi.nlm.nih.gov/12366297/
ID  - 12366297
ER  -