Skip to main content
SpringerLink
Log in

The power of polynomial size Ω-branching programs

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 88 (STACS 1988)

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

Included in the following conference series:

Abstract

In the following new types of branching programs, so-called Ω-branching programs, \(\Omega \subseteq \mathbb{B}_2\), are introduced. The complexity classes related to polynomial-size Ω-branching programs will be completely classified. Beside of identifying a new class P {⊕}−BP = L ⊕ /poly between L/poly and P/poly new characterizations of such fundamental complexity classes, like NL/poly and P/poly are obtained.

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. D.A.Barrington: Bounded width polynomial-size branching programs recognize exactly those languages in NC1, Proc. 18th STOC, 1986, 1–5

    Google Scholar 

  2. A.Borodin, S.Cook: A time-space tradeoff for sorting on a general sequential model of computation, Proc. 12th STOC 1980, 294–301

    Google Scholar 

  3. A.Cobham: The recognition problem for the set of perfect square, Research paper RC-1704, IBM Watson Research Centre, 1966

    Google Scholar 

  4. A.K.Chandra, D.Kozen, L.Stockmeyer: Alternation, J.Ass. Comp.Machinery 28, 114–133

    Google Scholar 

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

    Google Scholar 

  6. R.M.Karp, R.J.Lipton: Some connections between nonuniform and uniform complexity classes, Proc. 12th STOC, 1980,302–309

    Google Scholar 

  7. K.Kriegel, S.Waack: Exponential lower bounds for realtime branching programs, Proc. FCT'87, Kazan, LNCS 278, 263–267

    Google Scholar 

  8. Ch. Meinel: P-projection reducibility and the complexity classes L (nonuniform) and NL (nonuniform), Proc. 12-MFCS, 1986, Bratislava, LNCS 233, 527–535

    Google Scholar 

  9. Ch.Meinel: Rudiments of a branching program based complexity theory, to appear in Inf.& Comp.

    Google Scholar 

  10. E.Post: Introduction to a general theory of elementary propositions, Am.J.Math. 43, 163–185

    Google Scholar 

  11. P.Pudlak, S.Zak: Space complexity of computations, Preprint, Univ.of Prague, 1983

    Google Scholar 

  12. I. Wegener: Optimal decision trees and one-time-only branching programs for symmetric Boolean functions, Inf. and Control, Vol 62, 2/3, 1984

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Christoph Meinel

Authors
  1. Christoph Meinel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Robert Cori Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meinel, C. (1988). The power of polynomial size Ω-branching programs. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035834

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18834-6

  • Online ISBN: 978-3-540-48190-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation