A note on the almost-everywhere hierarchy for nondeterministic time

  • Eric Allender
  • Richard Beigel
  • Ulrich Hertrampf
  • Steven Homer
Conference paper

DOI: 10.1007/3-540-52282-4_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 415)
Cite this paper as:
Allender E., Beigel R., Hertrampf U., Homer S. (1990) A note on the almost-everywhere hierarchy for nondeterministic time. In: Choffrut C., Lengauer T. (eds) STACS 90. STACS 1990. Lecture Notes in Computer Science, vol 415. Springer, Berlin, Heidelberg

Abstract

We present an a.e. complexity hierarchy for nondeterministic time, and show that it is essentially the best result which can be proved using relativizable proof techniques.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Eric Allender
    • 1
  • Richard Beigel
    • 2
  • Ulrich Hertrampf
    • 3
  • Steven Homer
    • 4
  1. 1.Department of Computer ScienceRutgers UniversityNew BrunswickUSA
  2. 2.Department of Computer ScienceYale UniversityNew HavenUSA
  3. 3.Institut für InformatikUniversität WürzburgWürzburgFederal Republic of Germany
  4. 4.Department of Computer ScienceBoston UniversityBostonUSA

Personalised recommendations