Skip to main content
SpringerLink
Log in

The power of nondeterminism in polynomial-size bounded-width branching programs

  • Conference paper
  • First Online:
Book cover Fundamentals of Computation Theory (FCT 1987)

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

Included in the following conference series:

Abstract

Nondeterministic branching programs introduced in /Me86,1/ spelt out to be an interesting computational tool for describing higher complexity classes /Me86,2/. The investigation of the power of nondeterminism in the case of bounded-width nondeterministic branching programs yields: while polynomial-size bounded-width 1-time-only-nondeterministic branching programs are not more powerful than polynomial-size (usual) bounded-width branching programs, polynomial-size, bounded-width k-times-only-nondeterministic branching programs, k>1, are as powerful as polynomialsize, unbounded-width, nondeterministic branching programs. I.e.

$$\mathcal{P}_{bw - n_1 BP} = NC^1 and\mathcal{P}_{bw - n_k BP} = NP/poly,k > 1.$$

.

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 recognizing exactly those languages in NC1, Proc. 18-th STOC, 1986, 1–5

    Google Scholar 

  2. R.M.Karp, R.J.Lipton, 'sone connections between nonuniform and uniform complexity classes', Proc. 12-th STOC, 1980, 302–309

    Google Scholar 

  3. Ch.Meinel, ‘p-projection reducibility and the complexity classes L(nonuniform) and NL(nonuniform)', Proc. 12-th MFCS, Bratislava, 1p86, 527–53

    Google Scholar 

  4. Ch.Meinel, ‘Rudiments of a branching program based complexity theory', to appear in Information and Control

    Google Scholar 

  5. W. Savitch, ‘Relations between nondeterministic and deterministic tape complexities', J.Comp. and Sys. Sc. 4, 1970, 177–192

    Google Scholar 

  6. I.Wegener, ‘Complexity of Boolean Functions', Teubner Studienbuecher Informatik, 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Karl-Weierstrass-Institut fuer 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

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meinel, C. (1987). The power of nondeterminism in polynomial-size bounded-width branching programs. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_65

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_65

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation