A very simple function that requires exponential size read-once branching programs

Information Processing Letters

Volumn 66, Issue 2, 1998, Pages 53-57

  Bollig, Beate ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Boolean sums; Computational complexity; Problem of Zarankiewicz; Read once branching programs

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS;

READ ONCE BRANCHING PROGRAMS; ZARANKIEWICZ PROBLEM;

BOOLEAN FUNCTIONS;

EID: 0032050924     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00042-8     Document Type: Article

References (23)

1. M. Ajtai, L. Babai, P. Hajnal, J. Komlós, P. Pudlák, V. Rödl, E. Szemerédi, G. Turán. Two lower hounds for branching programs, in: Proc. 18th Symp. on Theory of Computing. Berkeley. CA, 1986. pp. 30-38.
2. A. Borodin, A. Razborov, R. Smolensky, On lower bounds for read-k-times branching programs. Comput. Complexity 3 (1993) 1-18.
3. S. Devadas, Comparing two-level and ordered binary decision diagram representations of logic functions. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems 5 (1993) 722-723.
4. A. Gál, A simple function that requires exponential size read-once branching programs. Inform. Process. Lett. 62 (1997) 13-16.
5. J. Gergov, C. Meinel, Efficient Boolean manipulation with OBDDs can be extended to FBDDs, IEEE Trans. Comput. 43 (1994) 1197-1209
6. S. Jukna, Entropy of contact circuits and lower bound on their complexity. Theoret. Comput. Sci. 57 (1988) 113-129.
7. S. Jukna, A. Razborov, P. Savický, I. Wegener, On P versus NP ∩ coNP for decision trees and read-once branching programs. in: Proc. Internat. Symp. on Mathematical Foundations of Computer Science. Lecture Notes in Comput. Sci., Vol. 1295, Springer, Berlin, 1997, pp. 319-326.
8. T. Kovari, V Sós, P. Turán, On a problem of K. Zarankiewicz, Colloq. Math. 3 (1954) 50-57.
9. M. Krause, Exponential lower bounds on the complexity of real time and local branching programs, J. Inform. Process. Cybernet. 24 (1988) 99-110
10. e, Theoret. Comput. Sci. 86 (1991) 267-275.
11. K. Kriegel, S Waack, Lower bounds on the complexity of real-time branching programs, in: Proc. Fundamentals of Computation Theory, Lecture Notes in Comput. Sci., Vol. 278, Springer, Berlin, 1987, pp. 263-267.
12. K. Mehlhorn, Some remarks on Boolean sums, Acta Inform. 12 (1979) 371-375.
13. E.I. Nechiporuk, On a Boolean matrix, Systems Theory Research 21 (1971) 236-239.
14. N. Pippenger, On another Boolean matrix, Tech. Rept. IBM. Yorktown Heights, NY, 1977.
15. S. Ponzio, A lower bound for integer multiplication with read-once branching programs, in: Proc. 27th Symp. on Theory of Computing. New York, 1905, pp. 130-139.
16. A. Razborov, Lower bounds for deterministic and nondeterministic branching programs, in: Proc. of Fundamentals of Computation Theory, Lecture Notes in Comput. Sci., Vol. 529, Springer, Berlin, 1991, pp. 47-60.
17. P. Savický, S. Žák, A large lower bound for 1-branching programs, ECCC Report TR 036-96, 1996.
18. D. Sieling, I. Wegener, Graph driven BDDs - a new data structure for Boolean functions. Theoret. Comput. Sci. 141 (1995) 283-310.
19. J. Simon, M. Szegedy, A new lower bound theorem for read-only-once branching programs and its applications, in: J. Cai (Ed.), Advances in Computational Complexity Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 13, Amer. Math. Soc., Providence, RI, 1993, pp. 183-193.
20. I. Wegener, A new lower bound on the monotone network complexity of Boolean sums. Acta Inform. 13 (1980) 109-114.
21. I. Wegener, On the complexity of branching programs and decision trees for clique functions. J. ACM 35 (1988) 461-471.
22. S. Žák. An exponential lower bound for one-time-only branching programs, in: Proc. Internat. Symp. on Mathematical Foundations of Computer Science. Lecture Notes in Comput. Sci., Vol. 176, Springer. Berlin, 1984, pp. 562-566.
23. K. Zarankiewicz, Problem 101, Colloq. Math. 2 (1951) 301.