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

Information Processing Letters

Volumn 62, Issue 1, 1997, Pages 13-16

  Gál, Anna ^a,b  

^a RUTGERS UNIVERSITY   (United States)

^b Princeton University   (United States)

Author keywords

Computational complexity; Projective planes; Read once branching programs

Indexed keywords

EID: 0003018178     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00041-0     Document Type: Article

References (21)

1. 1-formulae on finite structures, Ann. Pure Appl. Logic 24 (1983) 1-48.
2. M. Ajtai, L. Babai, P. Hajnal, J. Komlós, P. Pudlak, V. Rödl, E. Szemerédi and G. Turán, Two lower bounds for branching programs, in: Proc. 18th ACM STOC (1986) 30-38.
3. L. Babai, P. Hajnal, E. Szemerédi and G. Turán, A lower bound for read-once branching programs, J. Comput. System Sci. 35 (2) (1987) 153-162.
4. A. Borodin, A. Razborov and R. Smolensky, On lower bounds for read-k-times branching programs, Comput. Complexity 3 (1993) 1-18.
5. P.E. Dunne, Lower bounds on the complexity of 1-time only branching programs, in: FCT 85, Lecture Notes in Computer Science, Vol. 199 (Springer, New York, 1985) 90-99.
6. M. Furst, J. Saxe and M. Sipser, Parity, circuits and the polynomial time hierarchy, Math. Systems Theory 17 (1984) 13-27.
7. J. Hastad, Almost optimal lower bounds for small depth circuits, in: S. Micali, ed., Randomness and Computation, Advances in Computing Research, Vol. 5 (JAI Press, 1989) 143-170.
8. S. Jukna, Entropy of contact circuits and lower bound on their complexity, Theoret. Comput. Sci. 57 (1988) 113-129.
9. S. Jukna, A note on read-k-times branching programs, RAIRO Théor. Inform. Appl. 29 (1) (1995) 75-83.
10. S. Jukna and A. Razborov, A note on read-once branching programs for blocking sets in projective planes, Manuscript, November 1996.
11. M. Krause, Exponential lower bounds on the complexity of real time and local branching programs, J. Inform. Process. Cybernet. 24 (3) (1988) 99-110.
12. e, Theoret. Comput. Sci. 86 (1991) 267-275.
13. S. Ponzio, A lower bound for integer multiplication with read-once branching programs, in: Proc. 27th STOC (1995) 130-139.
14. P. Pudlak and S. Zak, Space complexity of computations, Tech. Rept., University of Prague, 1983.
15. A. Razborov, Lower bounds for deterministic and nondeterministic branching programs, in: Proc. 8th FCT, Lecture Notes in Computer Science, Vol. 529 (Springer, Berlin, 1991) 47-60.
16. J. Simon and M. Szegedy, A new lower bound theorem for read-only-once branching programs and its applications, in: Advances in Computational Complexity Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 13 (Amer. Math. Soc., Providence, RI, 1993) 183-193.
17. P. Saviczky and S. Zak, A large lower bound for 1-branching programs, ECCC Tech. Rept., TR96-036.
18. I. Wegener, On the complexity of branching programs and decision trees for clique functions, J. ACM 35 (1988) 461-471.
19. I. Wegener, The Complexity of Boolean Functions (Wiley-Teubner, 1987).
20. A. Yao, Separating the polynomial hierarchy by oracles, in: Proc. 26th FOCS (1985) 1-10.
21. S. Zak, An exponential lower bound for one time only branching programs, in: Proc. MFCS'84, Lecture Notes in Computer Science, Vol. 176 (Springer, Berlin, 1984) 562-566.