The power of polynomial size Ω-branching programs

  • Christoph Meinel
Contributed Papers Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ba86]
    D.A.Barrington: Bounded width polynomial-size branching programs recognize exactly those languages in NC1, Proc. 18th STOC, 1986, 1–5Google Scholar
  2. [BC80]
    A.Borodin, S.Cook: A time-space tradeoff for sorting on a general sequential model of computation, Proc. 12th STOC 1980, 294–301Google Scholar
  3. [Co66]
    A.Cobham: The recognition problem for the set of perfect square, Research paper RC-1704, IBM Watson Research Centre, 1966Google Scholar
  4. [CKS81]
    A.K.Chandra, D.Kozen, L.Stockmeyer: Alternation, J.Ass. Comp.Machinery 28, 114–133Google Scholar
  5. [Im87]
    N.Immerman: Nondeterministic space is closed under complement, Techn. Report 552, Yale Univ., 1987Google Scholar
  6. [KL80]
    R.M.Karp, R.J.Lipton: Some connections between nonuniform and uniform complexity classes, Proc. 12th STOC, 1980,302–309Google Scholar
  7. [KW87]
    K.Kriegel, S.Waack: Exponential lower bounds for realtime branching programs, Proc. FCT'87, Kazan, LNCS 278, 263–267Google Scholar
  8. [Me86]
    Ch. Meinel: P-projection reducibility and the complexity classes L (nonuniform) and NL (nonuniform), Proc. 12-MFCS, 1986, Bratislava, LNCS 233, 527–535Google Scholar
  9. [Me]
    Ch.Meinel: Rudiments of a branching program based complexity theory, to appear in Inf.& Comp.Google Scholar
  10. [Po21]
    E.Post: Introduction to a general theory of elementary propositions, Am.J.Math. 43, 163–185Google Scholar
  11. [PZ83]
    P.Pudlak, S.Zak: Space complexity of computations, Preprint, Univ.of Prague, 1983Google Scholar
  12. [We84]
    I. Wegener: Optimal decision trees and one-time-only branching programs for symmetric Boolean functions, Inf. and Control, Vol 62, 2/3, 1984Google Scholar
  13. [We87]
    I. Wegener: The Complexity of Boolean functions, Teubner, Stuttgart, 1987Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Christoph Meinel
    • 1
  1. 1.Karl-Weierstraß-Institut für MathematikAkademie der Wissenschaften der DDRBerlin

Personalised recommendations