Skip to main content
SpringerLink
Log in

On exponential lowness

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 226))

Included in the following conference series:

  • 122 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Balcázar and R. Book, On generalized Kolmogorov complexity, STACS 86, to appear.

    Google Scholar 

  2. J. Balcázar, R. Book, and U. Schöning, Sparse oracles, lowness, and highness, SIAM J. Computing 16 (1986), to appear.

    Google Scholar 

  3. R. Book, Tally languages and complexity classes, Info. & Control 26 (1974), 186–193.

    Google Scholar 

  4. A. Chandra, D. Kozen, and L. Stockmeyer, Alternation, J. Assoc. Comput. Mach. 28 (1981), 114–133.

    Google Scholar 

  5. M. Dekhtyar, On the relation of deterministic and nondeterministic complexity classes, Math. Found. Comput. Sci., Lecture Notes in Computer Science 45 (1977), Springer-Verlag, 282–287.

    Google Scholar 

  6. A. Goldberg and M. Sipser, Compression and ranking, Proc. 17 th ACM Sym. Theory of Computing 1985, 440–448.

    Google Scholar 

  7. J. Hartmanis, On aparse sets in NP-P, Info. Proc. Letters 16 (1983), 55–60.

    Google Scholar 

  8. J. Hartmanis, Generalized Kolmogorov complexity and the structure of feasible computations, Proc. 24 thIEEE Sump. Foundations of Computer Science (1983), 439–445.

    Google Scholar 

  9. J. Hartmanis, V. Sewelson, and N. Immerman, Sparse sets in NP-P: EXPTIME versus NEXPTIME, Proc. 15 th ACM Symp. Theory of Computing (1983), 382–391.

    Google Scholar 

  10. H. Heller, On relativized polynomial and exponential computations, SIAM J. Computing 13 (1984), 717–725.

    Google Scholar 

  11. R. Karp and R. Lipton, Some connections between nonuniform and uniform complexity classes, Proc. 12 th ACM Symp. Theory of Computing (1980), 302–309.

    Google Scholar 

  12. K. Ko and U. Schöning, On circuit-size complexity and the low hierarchy in NP, SIAM J. Computing 14 (1985), 41–51.

    Google Scholar 

  13. P. Orponen, Complexity class of alternating machines with oracles, Automata. Languages, and Programming, Lecture Notes in Computer Science 154 (1983), Springer-Verlag, 573–584.

    Google Scholar 

  14. U. Schöning, A low and a high hierarchy in NP, J. Comput. Syst. Sci. 27 (1983), 14–28.

    Google Scholar 

  15. J. Simon, On Some Central Probems in Computational Complexity, Ph.D. dissertation, Cornell University, 1975.

    Google Scholar 

  16. L. Stockmeyer, The polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1976), 1–22.

    Google Scholar 

  17. C. Wilson, Relativization, Reducibilities, and the Exponential Hierarachy, M. Sc. thesis, Univ. of Toronto, 1980.

    Google Scholar 

  18. C. Wrathall, Complete sets and the polylnomial-time hierarchy, Theoret. Comput. Sci. 3 (1976), 23–33.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California at Santa Barbara, 93106, Santa Barbara, Ca., USA

    R. Book & D. Russo

  2. Department of Computer Science, University of Helsinki, SF-00250, Helsinki 25, Finland

    P. Orponen

  3. Digital Sound, Inc., 93103, Santa Barbara, Ca., USA

    D. Russo

  4. Department of Information Science, Tokyo Institute of Technology, 152, Tokyo, Japan

    O. Watanabe

Authors
  1. R. Book
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Orponen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Russo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. O. Watanabe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Laurent Kott

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Book, R., Orponen, P., Russo, D., Watanabe, O. (1986). On exponential lowness. In: Kott, L. (eds) Automata, Languages and Programming. ICALP 1986. Lecture Notes in Computer Science, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_53

Download citation

  • DOI: https://doi.org/10.1007/3-540-16761-7_53

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16761-7

  • Online ISBN: 978-3-540-39859-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation