On the theory of average case complexity

Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Summary form only given, as follows. The authors take the next step in developing the theory of average case complexity initiated by L. A. Levin. Previous work has focused on the existence of complete problems. The present authors widen the scope to other basic questions in computational complexity. Their results include: (1) the equivalence of search and decision problems in the context of average case complexity; (2) an initial analysis of the structure of distributional-NP under reductions which preserve average polynomial-time; (3) a proof that if all distributional-NP is in average polynomial-time then nondeterministic exponential-time equals deterministic exponential time (i.e., a collapse in the worst-case hierarchy); and (4) definitions and basic theorems regarding other complexity classes such as average log-space.

Original languageEnglish
Title of host publicationProc Struct Complexity Theor Fourth Ann Conf
Editors Anon
PublisherPubl by IEEE
Pages36
Number of pages1
ISBN (Print)0818619589
StatePublished - 1989
Externally publishedYes
EventProceedings: Structure in Complexity Theory - Fourth Annual Conference - Eugene, OR, USA
Duration: 19 Jun 198922 Jun 1989

Publication series

NameProc Struct Complexity Theor Fourth Ann Conf

Conference

ConferenceProceedings: Structure in Complexity Theory - Fourth Annual Conference
CityEugene, OR, USA
Period19/06/8922/06/89

Fingerprint

Dive into the research topics of 'On the theory of average case complexity'. Together they form a unique fingerprint.

Cite this