Skip to main navigation Skip to search Skip to main content

Notes on Levin's theory of average-case complexity

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In 1984, Leonid Levin initiated a theory of average-case complexity. We provide an exposition of the basic definitions suggested by Levin, and discuss some of the considerations underlying these definitions.

Original languageEnglish
Title of host publicationStudies in Complexity and Cryptography
Subtitle of host publicationMiscellanea on the Interplay between Randomness and Computation
EditorsOded Goldreich
Chapter21
Pages233-247
Number of pages15
DOIs
StatePublished - 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6650 LNCS

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Notes on Levin's theory of average-case complexity'. Together they form a unique fingerprint.

Cite this