Advertisement

On the power of randomized branching programs

  • Farid Ablayev
  • Marek Karpinski
Session 8: Complexity Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1099)

Abstract

We define the notion of a randomized branching program in the natural way similar to the definition of a randomized circuit. We exhibit an explicit function fn for which we prove that:
  1. 1)

    fn can be computed by polynomial size randomized read-once ordered branching program with a small one-sided error;

     
  2. 2)

    fn cannot be computed in polynomial size by deterministic read-once branching programs;

     
  3. 3)

    fn cannot be computed in polynomial size by deterministic read-κ-times ordered branching program for k = o(n/log n) (the required deterministic size is exp (Ω (n/k))).

     

Keywords

Boolean Function Random Oracle Random Input Polynomial Size Communication Game 
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. [1]
    F. Ablayev, Lower bounds for probabilistic space complexity: communication-automata approach, in Proceedings of the LFCS'94, Lecture Notes in Computer Science, Springer-Verlag, 813, (1994), 1–7.Google Scholar
  2. [2]
    L. Adelman, Two theorems on random polynomial time, in Proceedings of the 19-th FOCS, (1978), 75–83.Google Scholar
  3. [3]
    M. Ajtai and M. Ben-Or, A theorem on randomized constant depth circuits, in Proceedings of the 16-th STOC, (1984), 471–474.Google Scholar
  4. [4]
    C. Bennet and J. Gill, Relative to a random oracle A, P A ≠ NPA ≠ co — NPA with probability 1, SIAM J. Comput, 10, (1981), 96–113.CrossRefGoogle Scholar
  5. [5]
    B. Boiling, M. Sauerhoff, D. Sieling, and I. Wegener, On the power of different types of restricted branching programs, ECCC Reports 1994, TR94-025.Google Scholar
  6. [6]
    R. Boppana and M. Sipser, The complexity of finite functions, in Handbook of Theoretical Computer Science, Vol A: Algorithms and Complexity, MIT Press and Elsevier, The Netherlands, 1990, ed. J Van Leeuwen, 757–804.Google Scholar
  7. [7]
    A. Borodin, A. Razborov, and R. Smolensky, On lower bounds for read-k-times branching programs, Computational Complexity, 3, (1993), 1–18.CrossRefGoogle Scholar
  8. [8]
    A. Borodin, Time-space tradeoffs (getting closer to barrier?), in Proceedings of the ISAAC'93, Lecture Notes in Computer Science, Springer-Verlag, 762, (1993), 209–220.Google Scholar
  9. [9]
    R. Bryant, Symbolic boolean manipulation with ordered binary decision diagrams, ACM Computing Surveys, 24, No. 3, (1992), 293–318.CrossRefGoogle Scholar
  10. [10]
    R. Frevalds, Fast probabilistic algorithms, in Proceedings of the Conference Mathematical Foundation of Computer Science 1979, Lecture Notes in Computer Science, Springer-Verlag, 74, (1979), 57–69.Google Scholar
  11. [11]
    R. Freivalds and M. Karpinski, Lower time bounds for randomized computation, in Proceedings of the ICALP'95, Lecture Notes in Computer Science, Springer-Verlag, 944, (1995), 183–195.Google Scholar
  12. [12]
    M. Krause, Lower bounds for depth-restricted branching programs, Information and Computation, 91, (1991), 1–14.CrossRefGoogle Scholar
  13. [13]
    C. Y. Lee, Representation of switching circuits by binary-decision programs, Bell System Technical Journal, 38, (1959), 985–999.Google Scholar
  14. [14]
    L. Lovasz, Communication complexity: a survey, in “Paths, Flows and VLSI Layout”, Karte, Lovasz, Proemel, Schrijver Eds., Springer-Verlag (1990), 235–266.Google Scholar
  15. [15]
    W. Masek, A fast algorithm for the string editing problem and decision graph complexity, M.Sc. Thesis, Massachusetts Institute of Technology, Cambridge, May 1976.Google Scholar
  16. [16]
    S. Ponzio, A lower bound for integer multiplication with read-once branching programs, Proceedings of the 27-th STOC, (1995), 130–139.Google Scholar
  17. [17]
    A. Razborov, Lower bounds for deterministic and nondeterministic branching programs, in Proceedings of the FCT'91, Lecture Notes in Computer Science, Springer-Verlag, 529, (1991), 47–60.Google Scholar
  18. [18]
    J. Simon and M. Szegedy, A new lower bound theorem for read-only-once branching programs and its applications, Advances in Computational Complexity Theory, ed. Jin-Yi Cai, DIMACS Series, 13, AMS (1993), 183–193.Google Scholar
  19. [19]
    I. Wegener, The complexity of Boolean functions. Wiley-Teubner Series in Comp. Sci., New York-Stuttgart, 1987.Google Scholar
  20. [20]
    I. Wegener, Efficient data structures for boolean functions, Discrete Mathematics, 136, (1994), 347–372.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Farid Ablayev
    • 1
  • Marek Karpinski
    • 2
  1. 1.Dept. of Computer ScienceUniversity of Bonn. Visiting from University of KazanFRG
  2. 2.Dept. of Computer ScienceUniversity of Bonn, and International Computer Science InstituteBerkeley

Personalised recommendations