Skip to main content
SpringerLink
Log in

Ω-branching programs of bounded width

  • Conference paper
  • First Online:
CSL '89 (CSL 1989)

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

Included in the following conference series:

  • 131 Accesses

Abstract

We investigate the question whether equipping some of the nodes of a width-bounded branching program with devices for evaluating Boolean functions does increase its computational power. In contrast to the situation for unbounded width branching programs, in the bounded width case we have to negate this question generalizing a result of Barrington.

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. Barrington, D.A.: Bounded-width polynomial size branching programs recognize exactly those languages in in NC1. In: Proc. of 18th ACM STOC, 1986, pp. 1–5. (the journal version will appear in JACM).

    Google Scholar 

  2. Damm, C.— Meinel, Ch.: Separating complexity classes related to polynomial size Ω-decision trees completely. Proc. of FCT'89, Szeged, LNCS 380, 127–136.

    Google Scholar 

  3. Krause,M.— Meinel,Ch.— Waack,S.: Separating the eraser Turing machine classes ℒe, NL e , co-NL e and P e. Proc. MFCS'88, Karlovy Vary, LNCS 324, pp. 405–413.

    Google Scholar 

  4. Krause,M.— Meinel,Ch.— Waack,S.: Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines. Proc. of 4. Structure in Complexity Theory, Eugene, IEEE Computer Press, 240–249, 1989.

    Google Scholar 

  5. Meinel,Ch.: p-projection reducibility and the complexity classes L(nonuniform) and NL(nonuniform). In: Proc. of MFCS'86, LNCS 233, pp. 527–535. (the journal version can be found in: EIK 23 (1987), No. 10/11, 545–558.)

    Google Scholar 

  6. Meinel,Ch.: The power of polynomial size Ω-branching programs. In: Proc. of STACS'88, Bordeaux, LNCS 294, pp. 81–90. (the journal version will appear in Information and Computation.)

    Google Scholar 

  7. Pudlak,P.— Žak,S.: Space complexity of computations, Preprint Univ. of Prague, 1983.

    Google Scholar 

  8. Savage, J.E.: The complexity of computing, Wiley, New York, 1976.

    Google Scholar 

  9. Wegener, I.: On the complexity of branching programs and decision trees for clique functions. In: JACM Vol. 35, No. 2 (1988), pp. 461–471.

    Article  Google Scholar 

  10. Wegener, I.: The Complexity of Boolean functions, Wiley-Teubner, Stuttgart, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik, Humboldt-Universitat Berlin, PF 1297, 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

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meinel, C. (1990). Ω-branching programs of bounded width. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '89. CSL 1989. Lecture Notes in Computer Science, vol 440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52753-2_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-52753-2_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52753-4

  • Online ISBN: 978-3-540-47137-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation