A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees

  • John G. Geske
  • Dung T. Huynh
  • Alan L. Selman
Contributed Papers Complexity

DOI: 10.1007/BFb0039600

Part of the Lecture Notes in Computer Science book series (LNCS, volume 247)
Cite this paper as:
Geske J.G., Huynh D.T., Selman A.L. (1987) A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees. In: Brandenburg F.J., Vidal-Naquet G., Wirsing M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1987

Authors and Affiliations

  • John G. Geske
    • 1
  • Dung T. Huynh
    • 2
  • Alan L. Selman
    • 3
  1. 1.Computer Science DepartmentIowa State UniversityAmes
  2. 2.Computer Science DepartmentUniversity of Texas at DallasRichardson
  3. 3.College of Computer ScienceNortheastern UniversityBoston

Personalised recommendations