A read-once lower bound and a (1,+ k)-hierarchy for branching programs

Theoretical Computer Science

Volumn 238, Issue 1-2, 2000, Pages 347-362

  Savicky P ^a   Zak S ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

Boolean functions; Branching programs; Lower bounds

Indexed keywords

EID: 0003660338     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00219-9     Document Type: Article

References (25)

1. F. Ablayev, Randomization and nondeterminism are incomparable for polynomial ordered binary decision diagrams, Proc. 24th ICALP, Lecture Notes in Computer Science, vol. 1256, Springer, Berlin, 1997, pp. 195-202.
2. N. Alon, M.B. Nathanson, I. Z. Ruzsa, The polynomial method and restricted sums of congruence classes, J. Number Theory 56 (1996) 404-417.
3. A.E. Andreev, J.L. Baskakov, A.E.F. Clementi, J.D.P. Rolim, Small pseudo-random sets yield hard functions: new tight explicit lower bounds for branching programs, Revision 2 of TR97-053, ECCC, Trier.
4. L. Babai, P. Hajnal, E. Szemeredi, G. Turan, A lower bound for read-once-only branching programs, J. Comput. Systems Sci. 35 (1987) 153-162.
5. A. Borodin, A. Razborov, R. Smolensky, On lower bounds for read-k-times branching programs, Comput. Complexity 3 (1993) 1-18.
6. K. Breitbart, H.B. Hunt III, D. Rosenkratz, On the size of binary decision diagrams representing Boolean functions, Theoret. Comput. Sci. 145 (1995) 45-69.
7. J.A. Dias da Silva, Y.O. Hamidoune, Cyclic spaces for Grassmann derivatives and additive theory, Bull. London Math. Soc. 26 (1994) 140-146.
8. P.E. Dunne, Lower bounds on the complexity of one-time-only branching programs, Proc. FCT, Lecture Notes in Computer Science, vol. 199, 1985, 90-99.
9. A. Gál, A simple function that requires exponential size read-once branching programs, Inform. Process. Lett. 62(1) (1996) 13-16.
10. S. Jukna, Entropy of contact circuits and lower bounds on their complexity, Theoret. Comput. Sci. 57 (1988) 113-129.
11. S. Jukna, A Note on Read-k-times Branching Programs, RAIRO Theoret. Inform. Appl. 29(1) (1995) 75-83.
12. S. Jukna, A.A. Razborov, Neither reading few bits twice nor reading illegally helps much, Discrete Appl. Math. 85(3) (1998) 223-238.
13. K. Kriegel, S. Waack, Lower bounds on the complexity of real-time branching programs, Proc. FCT, Lecture Notes in Computer Science, vol. 278, 1987, pp. 90-99.
14. E.A. Okolnishnikova, Lower bounds for branching programs computing characteristic functions of binary codes (in Russian), Metody diskretnogo Analiza 51 (1991) 61-83.
15. S.J. Ponzio, A lower bound for integer multiplication with read-once branching programs, Proc. 27's Ann. ACM Symp. on the Theory of Computing, Las Vegas, 1995, pp. 130-139.
16. K. Prachar, Distribution of Prime Numbers (in German), Primzahlverteilung, Springer, Berlin, 1957.
17. P. Savický, S. Žák, A lower bound on branching programs reading some bits twice, Theoret. Comput. Sci. 172 (1997) 293-301.
18. P. Savický, S. Žák, A large lower bound for 1-branching programs, TR96-036, ECCC, Trier.
19. P. Savický, S. Žák, A hierarchy for (1,+k)-branching programs with respect to k, Lecture Notes in Computer Science, vol. 1295, Proc. MFCS'97, 1997, pp. 478-487.
20. D. Sieling, New lower bounds and hierarchy results for restricted branching programs, J. Comput. System Sci. 53(1) (1996) 79-87.
21. D. Sieling, I. Wegener, New lower bounds and hierarchy results for restricted branching programs, in: Proc. workshop on Graph-Theoretic Concepts in Computer Science, WG'94, Lecture Notes in Computer Science, vol. 903, Springer, Berlin, 1994 pp. 359-370.
22. J. Simon, M. Szegedy, A new lower bound theorem for read only once branching programs and its applications, in: J. Cai (Ed.), Adv. Comput. Complexity Theory, DIMACS Series, vol. 13, AMS, 1993, pp 183-193.
23. I. Wegener, On the complexity of branching programs and decision trees for clique functions, JACM 35 (1988) 461-471.
24. S. Žák, An exponential lower bound for one-time-only branching programs, in: Proc. MFCS'84, Lecture Notes in Computer Science, vol. 176, Springer, Berlin, 1984, pp 562-566.
25. S. Žák, A superpolynomial lower bound for (1,+k(n))-branching programs, in Proc. MFCS'95, Lecture Notes in Computer Science, vol. 969, Springer, Berlin, 1995, pp. 319-325.