Skip to main content
SpringerLink
Log in

Separating the eraser turing machine classes Le, NLe, co-NLe and Pe

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

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

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. M.Ajtai, L.Babai, P.Hajnal, J.Komlos, P.Pudlak, V.Rödl, E.Szemeredi, G.Turan: Two lower bounds for branching programs, Proc. 18th ACM Symp. on Theory of Computing, 30–38

    Google Scholar 

  2. A.E.Andreev: On a method of obtaining lower bounds for the complexity of individual montone functions, Dokl. Akad. Nauk SSSR 282/5, 1033–1037

    Google Scholar 

  3. D.A.Barrington: Bounded-width polynomial size branching programs recognize exactly those languages in NC1, Proc. 18th ACM Symp. on Theory of Computing, 1–5

    Google Scholar 

  4. A.Borodin, S.Cook: A time-space tradeoff for sorting on a general sequential model of computation, Proc. 12th ACM Symp. on Theory of Computing 1980, 294–301

    Google Scholar 

  5. J.Hastad: Improved lower bounds for small depth circuits, Proc. 18th ACM Symp. on Theory of Computing

    Google Scholar 

  6. N. Immerman: Nondeterministic space is closed under complement, Techn. Report 552, Yale Univ., 1987

    Google Scholar 

  7. R.M.Karp, R.J.Lipton: Some connections between nonuniform and uniform complexity classes, Proc. 12th ACM Symp. on Theory of Computing, 1980, 302–309

    Google Scholar 

  8. M. Krause: Exponential lower bounds on the complexity of local and real-time branching programs, to appear in EIK 24 (1988), 3

    Google Scholar 

  9. K.Kriegel, S. Waack: Exponential lower bounds for real-time branching programs, Proc. Fundamentals of Computation Theory'87, Kazan, LNCS 278, 263–267

    Google Scholar 

  10. Ch.Meinel: p-projection reducibility and the complexity classes L (nonuniform) and NL (nonuniform), Proc. 12th MFCS, Bratislava, LNCS 233, 527–535; revised and extended version in EIK 23 (1987), 10/11, 545–558

    Google Scholar 

  11. Ch.Meinel: The power of polynomial size Ω-branching programs, Proc. STAC'88, Bourdeaux, LNCS 294, 81–90

    Google Scholar 

  12. A.A.Razborov: A lower bound for the monotone network complexity of the logical permanent, Matem. Zametki 37/6

    Google Scholar 

  13. I. Wegener: The Complexity of Boolean functions, Teubner, Stuttgart, 1987

    Google Scholar 

  14. A.C.Yao: Separating the poynomial-time hierarchy by oracles, Proc. 26th IEEE Symp. on Foundations of Computer Science, 1–10

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik, Humboldt Universität Berlin, DDR-1086, Berlin, PF

    Matthias Krause

  2. Karl-Weierstraß-Institut für Mathematik, Akademie der Wissenschaften der DDR, PF 1304, DDR-1086, Berlin

    Christoph Meinel & Stephan Waack

Authors
  1. Matthias Krause
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christoph Meinel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stephan Waack
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krause, M., Meinel, C., Waack, S. (1988). Separating the eraser turing machine classes Le, NLe, co-NLe and Pe . In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017163

Download citation

  • DOI: https://doi.org/10.1007/BFb0017163

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation