Advertisement

New lower bounds and hierarchy results for restricted branching programs

  • Detlef Sieling
  • Ingo Wegener
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 903)

Abstract

Known lower bound techniques for depth restricted branching programs are not sensitive enough to lead to tight hierarchies. A new lower bound technique implies the separation of the classes of polynomial-size branching programs, where on each path k variables may be tested more than once and k≤(1−ε)(n/3)1/3/ log2/3n for some ε>0. Methods from communication complexity theory are adopted to separate the classes of polynomial-size ordered read k times branching programs, where k=o(n1/2/ log2n).

Keywords

Decision Tree Boolean Function Communication Complexity Computation Path Partial Assignment 
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.
    Alon, N. and Maass, W.: Meanders and their applications in lower bound arguments. Journal of Computer and System Sciences 37 (1988) 118–129Google Scholar
  2. 2.
    Barrington, D.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1. In 18th Symp. on Theory of Comp. (1986) 1–5Google Scholar
  3. 3.
    Bollig, B., Sauerhoff, M., Sieling, D. and Wegener, I.: Read k times ordered binary decision diagrams — efficient algorithms in the presence of null-chains. Preprint Univ. Dortmund (1993)Google Scholar
  4. 4.
    Borodin, A., Razborov, A. and Smolensky, R.: On lower bounds for read-k-times branching programs. Computational Complexity 3 (1993) 1–18Google Scholar
  5. 5.
    Bryant, R.E.: Symbolic manipulation of Boolean functions using a graphical representation. In 22nd Design Automation Conference (1985) 688–694Google Scholar
  6. 6.
    Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers 35 (1986) 677–691Google Scholar
  7. 7.
    Bryant, R.E.: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Transactions on Computers 40 (1991) 205–213Google Scholar
  8. 8.
    Duris, P., Galil, Z. and Schnitger, G.: Lower bounds of communication complexity. In 16th Symp. on Theory of Comp. (1984) 81–91Google Scholar
  9. 9.
    Gergov, J. and Meinel, C.: Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs. In 10th Symp. on Theoretical Aspects of Computer Science (1993) 576–585Google Scholar
  10. 10.
    Halstenberg, B. and Reischuk, R.: On different modes of communication. In 20th Symp. on Theory of Comp. (1988) 162–172Google Scholar
  11. 11.
    Krause, M.: Lower bounds for depth-restricted branching programs. Information and Computation 91 (1991) 1–14Google Scholar
  12. 12.
    Lam, T. and Ruzzo, L.: Results on communication complexity classes. In 4th Structures in Complexity Theory Conference (1989) 148–157Google Scholar
  13. 13.
    MacWilliams, F.J. and Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland Publishing Company (1977)Google Scholar
  14. 14.
    McGeoch, L.A.: A strong separation between k and k-1 round communication complexity for a constructive language. Techn. Rep. CMU-CS-86-157, Carnegie Mellon University, Pittsburg, PA (1986)Google Scholar
  15. 15.
    Nečiporuk, È.I.: A Boolean function. Soviet Mathematics Doklady 7(4) (1966) 999–1000Google Scholar
  16. 16.
    Nisan, N. and Wigderson, A.: Rounds in communication complexity revisited. SIAM Journal on Computing 22 (1993) 211–219Google Scholar
  17. 17.
    Okolnisch'kova, E.A.: Lower bounds on the complexity of realization of characteristic functions of binary codes by branching programs. Diskretnii Analiz 51 (1991) 61–83 (in Russian)Google Scholar
  18. 18.
    Sieling, D. and Wegener, I.: Graph driven BDD's — A new data structure for Boolean functions. Theoretical Computer Science (to appear)Google Scholar
  19. 19.
    Wegener, I.: The complexity of Boolean functions. Wiley (1987)Google Scholar
  20. 20.
    Wegener, I.: On the complexity of branching programs and decision trees for clique functions. Journal of the ACM 35(2) (1988) 461–471Google Scholar
  21. 21.
    Wegener, I.: Efficient data structures for Boolean functions. Discrete Mathematics (Special Volume on “Trends in Discrete Mathematics”, to appear)Google Scholar
  22. 22.
    Žák, S.: An exponential lower bound for one-time-only branching programs. In 11th Symp. on Mathematical Foundations of Computer Science (1984) 562–566Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Detlef Sieling
    • 1
  • Ingo Wegener
    • 1
  1. 1.FB Informatik, LS IIUniv. DortmundDortmundFed. Rep. of Germany

Personalised recommendations