A hierarchy for (1, +k)-branching programs with respect to k

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1295, Issue , 1997, Pages 478-487

  Savicky P ^a   Zak S ^a  

^a INSTITUTE OF MATHEMATICS   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

BRANCHING PROGRAMS; DECISION DIAGRAM; GENERAL GRAPH; LOWER BOUNDS; POLYNOMIAL SIZE; SEQUENTIAL COMPUTATIONS;

SYNTACTICS;

EID: 0040981620     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0029991     Document Type: Conference Paper

References (20)

1. N. Alon, M. B. Nathanson and I. Z. Ruzsa, The polynomial method and restricted sums of congruence classes, J. Number Theory, to appear.
2. L. Babai, P. Hajnal, E. Szemeredi and G. Turan, A lower bound for read-once-only branching progrmms, Journal of Computer and Systems Sciences, vol. 35 (1987), 153-162.
3. A. Borodin, A Razborov and R. Smolensky, On Lower Bounds for Read-k-times Branching Programs, Computational Comple.Tity 3 (1993) 1-18.
4. J. A. Dias da Silva and Y. O. Hamidoune, Cyclic spaces for Grassmann derivatives and additive theory, Bull. London Math. Soc., 26 (1994), 140-146.
5. P. E. Dunne, Lower bounds on the complexity of one-time-only branching programs, In Proceedings of the FCT, Lecture Notes in Computer Science, 199 (1985), 90-99.
6. S. Jukna, A Note on Read-k-times Branching Programs, RAIRO Theoretical Informatics and Applications, voI. 29, Nr. 1 (1995), pp. 75-83.
7. S. Jukna, Entropy of Contact Circuits and Lower Bounds on Their Complexity, Theoretical Cormputer Science, 57 (1988), pp. 113-129.
8. S. Jukna, A. A. Razborov, Neither Reading Few Bits Twice nor Reading Illegally Helps Much, TR96-037, ECCC, Trier.
9. E. A. Okolnishnikova, Lower bounds for branching programs computing characteristic functions of binary codes (in Russian), Metody disk'retnogo Analiza, 51 (1991), 61-83.
10. E. A. Okolnishnikova, Comparing the complexity of binary k-programs (in Russian), Diskretnyj analiz i issledovanije operacij, 1995. Vol. 2. No. 4. pp. 54-73.
11. S. J. Ponzio, A lower bound for integer multiplication with read-once branching programs, Proceedings of 27's Annual ACM Symposium on the Theory of Computing, Los Vegas, 1995, pp. 130-139.
12. K. Prachar, Distribution of Prime Numbers (in German), Primzahlverteilung, Springer-Verlag, Berlin-Göttingen-Heidelberg, 1957.
13. P. Savický, S. Žák, A Lower Bound on Branching Programs Reading Some Bits Twice, to appear in TCS.
14. P. Savický, S. Žák, A Large Lower bound for 1-branching programs, TR96-036, ECCC, Trier.
15. D. Sieling, New Lower Bounds and Hierarchy Results for Restricted Branching Programs, TR 494, 1993, Univ. Dortmund, to appear in J. of Computer and System Sciences.
16. D. Sieling and L Wegener, New Lower bounds and hierarchy results for Restricted Branching Programs, in Proc. of Workshop on Graph-Theoretic Concepts in Computer Science WG'94, Lecture Notes in Computer Science Vol. 903 (Springer,Berlin, 1994) 359-370.
17. J. Simon, M. Szegedy, A New Lower Bound Theorem for Read Only Once Branching Programs and its Applications, Advances in Computational Complexity Theory (J, Cai, editor), DIMACS Series, Vol. 13, AMS (1993) pp. 183-193.
18. I. Wegener, On the Complexity of Branching Programs and Decision Trees for Clique Functions, JACM35 (1988) 461-471.
19. 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) 562-566.
20. 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) 319-325.