Integrity report for 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

A machine-verified record of the checks Pith has run against this paper: detector runs, findings, signed bundle events, and canonical identifiers.

arXiv:cond-mat/0203012

Paper page arXiv integrity.json

Detector runs

Findings

Signed record

The machine-readable record for this paper lives at /pith/cond-mat/0203012/integrity.json. Pith Number bundles also include signed pith.integrity.v1 events where a Pith Number exists.