Advertisement

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

  • Christoph Meinel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)

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.$$
.

Keywords

Boolean Function Turing Machine Complexity Class Polynomial Size Boolean Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. /Ba86/.
    D.A.Barrington, ‘Bounded width polynomial-size branching programs recognizing exactly those languages in NC1, Proc. 18-th STOC, 1986, 1–5Google Scholar
  2. /KL80/.
    R.M.Karp, R.J.Lipton, 'sone connections between nonuniform and uniform complexity classes', Proc. 12-th STOC, 1980, 302–309Google Scholar
  3. /Me86,1/.
    Ch.Meinel, ‘p-projection reducibility and the complexity classes L(nonuniform) and NL(nonuniform)', Proc. 12-th MFCS, Bratislava, 1p86, 527–53Google Scholar
  4. /Me86,2/.
    Ch.Meinel, ‘Rudiments of a branching program based complexity theory', to appear in Information and ControlGoogle Scholar
  5. /Sa70/.
    W. Savitch, ‘Relations between nondeterministic and deterministic tape complexities', J.Comp. and Sys. Sc. 4, 1970, 177–192Google Scholar
  6. /We87/.
    I.Wegener, ‘Complexity of Boolean Functions', Teubner Studienbuecher Informatik, 1987Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Christoph Meinel
    • 1
  1. 1.Karl-Weierstrass-Institut fuer MathematikAkademie der Wissenschaften der DDRBerlin

Personalised recommendations