Hierarchy theorems for kOBDDs and kIBDDs

Theoretical Computer Science

Volumn 205, Issue 1-2, 1998, Pages 45-60

  Bollig, Beate ^a   Sauerhoff, Martin ^a   Sieling, Detlef ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Binary decision diagrams; Branching programs; Communication complexity; Hierarchies; Lower bounds

Indexed keywords

EID: 0002793402     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00034-0     Document Type: Article

References (25)

1. N. Alon, W. Maass, Meanders, Ramsey theory and lower bounds for branching programs, in: 22nd Symp. on Found, of Computer Science, 1986, pp. 410-417.
2. L. Babai, P. Kimmel, S.V. Lokam, Simultaneous messages vs. communication, in: STACS'95, Lecture Notes in Computer Science, vol. 900, Springer, Berlin, 1995, pp. 361-372.
3. L. Babai, N. Nisan, M. Szegedy, Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs, J. Comput. System Sci. 45 (1992) 204-232.
4. J. Bitner, J. Jain, M. Abadir, J.A. Abraham, D.S. Fussell, Efficient algorithmic circuit verification using indexed BDDs, in: Fault Tolerant Computing Symp., 1994, pp. 266-275.
5. A. Borodin, A. Razborov, R. Smolensky, On lower bounds for read-k times branching programs, Comput. Complexity 3 (1993) 1-18.
6. R. E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Trans. Computers 35 (1986) 677-691.
7. R.E. Bryant, Symbolic Boolean manipulation with ordered binary decision diagrams, ACM Computing Surveys 24 (1992) 293-318.
8. A.K. Chandra, M.L. Furst, R.J. Lipton, Multiparty protocols, in: 15th Symp. on Theory of Computing, 1983, pp. 94-99.
9. C. Damm, S. Jukna, J. Sgall, Some bounds on multiparty communication complexity of pointer jumping, in: STACS'96, Lecture Notes in Computer Science, vol. 1046, 1996, pp. 643-654.
10. P. Duris, Z, Galil, G. Schnitger, Lower bounds of communication complexity, in: 16th Symp. on Theory of Computing, 1984, pp. 81-91.
11. B. Halstenberg, R. Reischuk, On different modes of communication, in: 20th Symp. on Theory of Computing, 1988, pp. 162-172.
12. J. Jain, M. Abadir, J. Bitner, D.S. Fussell, J.A. Abraham, IBDDs: an efficient functional representation for digital circuits, in: European Design Automation Conference, 1992, pp. 440-446.
13. M. Krause, Untere Schranken für Berechnungen durch Verzweigungsprogramme, Ph.D. Thesis, Humboldt Univ. Berlin, 1988.
14. M. Krause, Lower bounds for depth-restricted branching programs, Inform. and Comput. 91 (1991) 1-14.
15. M. Krause, S. Waack, On oblivious branching programs of linear length, Inform. Comput. 94 (1991) 232-249.
16. T. Lam, L. Ruzzo, Results on communication complexity classes, in: 4th Structures in Complexity Theory Conference, 1989, pp. 148-157.
17. L.A. McGeoch, A strong separation between k and k -1 round communication complexity for a constructive language, Tech. Rep. CMU-CS-86-157, Carnegie Mellon University, Pittsburg, PA, 1986.
18. È.I. Nečiporuk, A Boolean function, Sov. Math. Dokl. 7 (4) (1966) 999-1000.
19. N. Nisan, A. Wigderson, Rounds in communication complexity revisited, SIAM J. Comput. 22 (1993) 211-219.
20. E.A. Okolnishnikova, Lower bounds on the complexity of realization of characteristic functions of binary codes by branching programs. Diskretnii Analiz 51 (1991) 61-83 (in Russian). Siberian Adv. Math. 3 (1993) 152-166.
21. E.A. Okolnishnikova, Lower bounds on the complexity of realization of characteristic functions of binary codes by branching programs. Diskretnii Analiz 51 (1991) 61-83 (in Russian). Siberian Adv. Math. 3 (1993) 152-166.
22. D. Sieling, I. Wegener, New lower bounds and hierarchy results for restricted branching programs, in: Proc. 20th Workshop on Graph Theoretic Concepts in Computer Science, WG'94, Lecture Notes in Computer Science, vol. 903, 1995, pp. 359-370.
23. I. Wegener, The complexity of Boolean functions, Wiley-Teubner, 1987.
24. I. Wegener, On the complexity of branching programs and decision trees for clique functions, J. ACM 35 (2) (1988) 461-471.
25. S. Žák, An exponential lower bound for one-time-only branching programs, in: 11th Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 176, Springer, Berlin, 1984, pp. 562-566.