Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph-Theoretic Concepts in Computer Science

WG 1994: Graph-Theoretic Concepts in Computer Science pp 359–370Cite as

New lower bounds and hierarchy results for restricted branching programs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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/3 n 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(n 1/2/ log2 n).

Supported in part by DFG grant We 1066/7-1.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N. and Maass, W.: Meanders and their applications in lower bound arguments. Journal of Computer and System Sciences 37 (1988) 118–129

    Google Scholar 

  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–5

    Google Scholar 

  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. Borodin, A., Razborov, A. and Smolensky, R.: On lower bounds for read-k-times branching programs. Computational Complexity 3 (1993) 1–18

    Google Scholar 

  5. Bryant, R.E.: Symbolic manipulation of Boolean functions using a graphical representation. In 22nd Design Automation Conference (1985) 688–694

    Google Scholar 

  6. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers 35 (1986) 677–691

    Google Scholar 

  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–213

    Google Scholar 

  8. Duris, P., Galil, Z. and Schnitger, G.: Lower bounds of communication complexity. In 16th Symp. on Theory of Comp. (1984) 81–91

    Google Scholar 

  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–585

    Google Scholar 

  10. Halstenberg, B. and Reischuk, R.: On different modes of communication. In 20th Symp. on Theory of Comp. (1988) 162–172

    Google Scholar 

  11. Krause, M.: Lower bounds for depth-restricted branching programs. Information and Computation 91 (1991) 1–14

    Google Scholar 

  12. Lam, T. and Ruzzo, L.: Results on communication complexity classes. In 4th Structures in Complexity Theory Conference (1989) 148–157

    Google Scholar 

  13. MacWilliams, F.J. and Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland Publishing Company (1977)

    Google Scholar 

  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. Nečiporuk, È.I.: A Boolean function. Soviet Mathematics Doklady 7(4) (1966) 999–1000

    Google Scholar 

  16. Nisan, N. and Wigderson, A.: Rounds in communication complexity revisited. SIAM Journal on Computing 22 (1993) 211–219

    Google Scholar 

  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. Sieling, D. and Wegener, I.: Graph driven BDD's — A new data structure for Boolean functions. Theoretical Computer Science (to appear)

    Google Scholar 

  19. Wegener, I.: The complexity of Boolean functions. Wiley (1987)

    Google Scholar 

  20. Wegener, I.: On the complexity of branching programs and decision trees for clique functions. Journal of the ACM 35(2) (1988) 461–471

    Google Scholar 

  21. Wegener, I.: Efficient data structures for Boolean functions. Discrete Mathematics (Special Volume on “Trends in Discrete Mathematics”, to appear)

    Google Scholar 

  22. Žák, S.: An exponential lower bound for one-time-only branching programs. In 11th Symp. on Mathematical Foundations of Computer Science (1984) 562–566

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Informatik, LS II, Univ. Dortmund, 44221, Dortmund, Fed. Rep. of Germany

    Detlef Sieling & Ingo Wegener

Authors
  1. Detlef Sieling
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ingo Wegener
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ernst W. Mayr Gunther Schmidt Gottfried Tinhofer

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sieling, D., Wegener, I. (1995). New lower bounds and hierarchy results for restricted branching programs. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1994. Lecture Notes in Computer Science, vol 903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59071-4_61

Download citation

  • DOI: https://doi.org/10.1007/3-540-59071-4_61

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59071-2

  • Online ISBN: 978-3-540-49183-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation