Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1989: Fundamentals of Computation Theory pp 127–136Cite as

Separating completely complexity classes related to polynomial size Ω-Decision trees

  • Conference paper
  • First Online:

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

Abstract

In proving exponential lower and polynomial upper bounds for parity decision trees and collecting similar bounds for nondeterministic and co-nondeterministic decision trees we completely separate the complexity classes related to polynomial size deterministic, nondeterministic, co-nondeterministic, parity, and alternating decision trees.

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

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.Rdl, E.Szemeredi, G.Turán: Two lower bounds for branching programs, Proc. 18th ACM STOC, 30–38.

    Google Scholar 

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

    Google Scholar 

  3. L. Budach: A lower bound for the number of nodes in a decision tree. EIK 21 (1985), 221–228.

    Google Scholar 

  4. Furst, Saxe, M. Sipser: Parity, circuits and the polynomial time hierarchy, Proc. 22th IEEE FOCS, 1981, 260–270.

    Google Scholar 

  5. J.Hastad: Improved lower bounds for small depth circuits, Proc. 18th ACM STOC (1986), 6–20.

    Google Scholar 

  6. M.Krause, Ch.Meinel, S.Waack: Separating the eraser Turing machine classes L, NL, co-NL and P, Proc. MFCS'88, LNCS 324, 405–413.

    Google Scholar 

  7. Ch.Meinel: The power of polynomial size Ω-branching programs, Proc. STACS'88 Bordeaux, LNCS 294, 81–90.

    Google Scholar 

  8. M.S.Paterson: On Razborov's result for bounded depth circuits over {⊕, Λ}, manuscript.

    Google Scholar 

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

    Google Scholar 

  10. A.A.Razborov: Lower bounds on the size of circuits of bounded depth over the basis {Λ, ⊕}, preprint, Steklov Inst. for Math., Moscow 1986, (see also Mat. Zam. 41, no.4 (1987), 598–607) (in Russian).

    Google Scholar 

  11. I. Wegener: Optimal decision trees and one-time-only branching programs for symmetric Boolean functions, Inf. and Control, Vol. 62, Nos. 2/3 (1984), 129–143.

    Article  Google Scholar 

  12. I. Wegener: On the Complexity of Branching Programs and Decision Trees for Clique Functions, JACM Vol. 35, No. 2 (1988), 461–471.

    Article  Google Scholar 

  13. A.C.Yao Separating the polynomial-time hierarchy by oracles, Proc.26th IEEE FOCS (1985), 1–10.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Carsten Damm & Christoph Meinel

Authors
  1. Carsten Damm
    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

Editor information

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Damm, C., Meinel, C. (1989). Separating completely complexity classes related to polynomial size Ω-Decision trees. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51498-5

  • Online ISBN: 978-3-540-48180-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation