Advertisement

On the hierarchy of nondeterministic branching k-programs

  • Elizaveta A. Okol'nishnikova
Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1279)

Abstract

We compare the complexities of Boolean functions for nondeterministic read-k-times branching and read-sk-times branching programs. We show that for each natural number k, k ≥ 2, there exists a sequence of Boolean functions such that the complexity of computation of every function of this sequence by nondeterministic read-k-times branching programs is exponentially larger than by nondeterministic read-(k In k/ In 2 + C)-times branching programs (with respect to the number of variables of the Boolean function), where C is a constant independent of k. Besides it is shown that for each natural numbers N and k, \(4 \leqslant k \prec \sqrt {\ln N} /\ln \ln N\), there exists a Boolean function on N variables such that the complexity of this function for nondeterministic read-k-times branching programs is exponentially larger (on the number of variables of the Boolean function) than for nondeterministic read(k In k/ In 2 + C)-times branching programs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L. Babai, P. Hajnal, E. Szemerédi, and G. Turin (1987) A lower bound for readonce-only branching programs. J. Comput. System Sci. 35, No. 2, 153–162.CrossRefGoogle Scholar
  2. 2.
    A. B. Borodin, A. A. Razborov, and R. Smolensky (1993) On lower bounds for read-k-times branching programs, Comput. Complexity 3, No. 1, 1–18.CrossRefGoogle Scholar
  3. 3.
    P. E. Dunne (1985) Lower bounds on the complexity of 1-time only branching programs (preliminary version), Fundamentals of Computation Theory, Lecture Notes in Comput. Sci. Vol. 199, Springer-Verlag, Berlin, pp. 90–95.Google Scholar
  4. 4.
    S. Jukna (1995) A note on read-k times branching programs, R A I R O Theoretical Informatics and Applications, 29, No. 1, 75–83.Google Scholar
  5. 5.
    E. A. Okol'nishnikova (1988) On a relation for the complexity of Boolean functions, VIII All-Union Conference on Problems of Theoretical Cybernetics. Abstract of Reports (in Russian), Gor'kov. University, Gor'kiį, p. 63.Google Scholar
  6. 6.
    E. A. Okol'nishnikova (1991) Lower bounds on complexity for the realization of characteristic functions of binary codes by binary programs (in Russian), Melody Diskret. Anal. 51, 61–83 (see also: Siberian Adv. Math. 3 (1993), No. 1, 152-166).Google Scholar
  7. 7.
    E. A. Okol'nishnikova (1995) On Comparison Between the Sizes of Read-k-Times Branching Programs (in Russian), Diskretnij Analis i issledovanie operatchij v.2(4), 54–73 (see also: E. A. Okol'nishnikova (1997) On Comparison Between the Sizes of Read-k-Times Branching Programs, Operation Research and Discrete Analysis (ed. A.D.Korshunov) (Series: Mathematics and Its Applications), Kluwer Academic Publishers, Netherlands, pp. 205-225.)Google Scholar
  8. 8.
    A. A. Razborov (1991) Lower bounds for deterministic and nondeterministic branching programs, Fundamentals of Computation Theory (Gosen, 1991), Lecture Notes in Comput. Sci. Vol. 529, Springer-Verlag, Berlin, pp. 47–60.Google Scholar
  9. 9.
    D. Sieling and I. Wegener (1995) New lower bounds and hierarchy results for restricted branching programs, Graph-theoretical Concepts in Computer Science, Lecture Notes in Comput. Sci. Vol. 903, Springer-Verlag, Berlin, pp. 359–370.Google Scholar
  10. 10.
    S. Žak (1984) An exponential lower bound for one-time only branching programs, Mathematical Foundations of Computer Science, Lecture Notes in Comput. Sci. Vol. 199, Springer-Verlag, Berlin, pp. 562–566.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Elizaveta A. Okol'nishnikova
    • 1
  1. 1.Sobolev Institute of Mathematics of the Siberian Branch of Russian Academy of SciencesNovosibirskRussia

Personalised recommendations