Abstract
More than two decades elapsed since Levin set forth a theory of average-case complexity. In this survey we present the basic aspects of this theory as well as some of the main results regarding it. The current presentation deviates from our old Notes on Levin's Theory of Average-Case Complexity (ECCC, TR97-058, 1997) in several aspects. In particular: - We currently view average-case complexity as referring to the performance on (or rather typical) instances, and not as the average performance on random instances. (Thus, it may be more justified to refer to this theory by the name typical-case complexity, but we retain the name average-case for historical reasons.) - We include a treatment of search problems, and a presentation of the reduction of NP with sampleable to NP with P-computable (due to Impagliazzo and Levin, 31st FOCS, 1990). - We include Livne's result (ECCC, TR06-122, 2006) by which all natural NPC-problems have average-case complete versions. This result seems to shed doubt on the association of P-computable distributions with natural distributions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
