(Q51640567)
Statements
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 (English)
19 September 2002
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference