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.
| Image |  |
|---|---|
| Description | scientific article published on 19 September 2002 |
| Author/s |
author: Simona Cocco |
| Publication date | September 19, 2002 |
| Language | English |
| Country of origin | |
| Wikipedia link | |
| Copyright status | |
| Missing/wrong data? | Edit Wikidata item |