Neither reading few bits twice nor reading illegally helps much

Discrete Applied Mathematics

Volumn 85, Issue 3, 1998, Pages 223-238

  Jukna, S ^a,b   Razborov, A ^c  

^a UNIVERSITY OF TRIER   (Germany)

^b Institute of Mathematics   (Lithuania)

^c STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

Branching programs; Complexity; Corrupting machines; Lower bounds; Switching and rectifier networks

Indexed keywords

EID: 0000334061     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00042-0     Document Type: Article

References (23)

1. L. Babai, P. Hajnal, E. Szemerédi, G. Turán, A lower bound for read-once-only branching programs, J. Comput. System Sci. 35 (1987) 153-162.
2. A. Borodin, A. Razborov, R. Smolensky, On lower bounds for read-k times branching programs, Comput. Complexity 3 (1993) 1-18.
3. P.E. Dunne, Lower bounds on the complexity of one-time-only branching programs, in: Proc. FCT'85, Lecture Notes in Computer Science, vol. 199, Springer, Berlin, 1985, pp. 90-99.
4. S. Jukna, Lower bounds on the complexity of local circuits, in: Proc. MFCS'86, Lecture Notes in Comput. Science, vol. 233, Springer, Berlin, 1986, pp. 440-448. [Journal version: S. Jukna, Entropy of contact circuits and lower bounds on their complexity, Theoret. Computer Sci. 57 (1988) 113-129.]
5. S. Jukna, Lower bounds on the complexity of local circuits, in: Proc. MFCS'86, Lecture Notes in Comput. Science, vol. 233, Springer, Berlin, 1986, pp. 440-448. [Journal version: S. Jukna, Entropy of contact circuits and lower bounds on their complexity, Theoret. Computer Sci. 57 (1988) 113-129.]
6. S. Jukna, A note on read-k-times branching programs, Informatique Theorique Appl./Theoret. Inform. Appl. 29 (1) (1995) 75-83.
7. M. Krause, Exponential lower bounds on the complexity of local and real-time branching programs. J. EIK 24 (3) (1988) 99-110.
8. e, Theoret. Computer Sci. 86 (1991) 267-275.
9. K. Kriegel, S. Waack, Lower bounds on the complexity of real-time branching programs, in: Proc. FCT'87, Lecture Notes in Computer Science, vol. 278, Springer, Berlin, 1987, pp. 90-99.
10. F. J. Mac Williams, N.J.A. Sloane, The Theory of Error-correcting Codes. Elsevier, North-Holland, 1977.
11. W. Masek, A fast algorithm for the string editing problem and decision graph complexity, Master's Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1976.
12. E. I. Nechiporuk, Ob odnoǐ bulevskoǐ funktsii, DAN SSSR 169(4) (1966) 765-766 E. I. Nečiporuk, On a Boolean function, Sov. Math. Doklady 7 (4) (1966) 999-1000.
13. E. I. Nechiporuk, Ob odnoǐ bulevskoǐ funktsii, DAN SSSR 169(4) (1966) 765-766 E. I. Nečiporuk, On a Boolean function, Sov. Math. Doklady 7 (4) (1966) 999-1000.
14. E. A. Okolnishnikova Nizhnie otsenki slozhnosti realizatsii kharakteristicheskikh funktsiǐ dvoichnykh kodov binarnymi programmami, Metody diskretnogo analiza 51 (1991) 61-83. E. A. Okolnishnikova, Lower bounds for branching programs computing characteristic functions of binary codes, Metody Discretnogo Analiza 51 (1991) 61-83 (in Russian).
15. E. A. Okolnishnikova Nizhnie otsenki slozhnosti realizatsii kharakteristicheskikh funktsiǐ dvoichnykh kodov binarnymi programmami, Metody diskretnogo analiza 51 (1991) 61-83. E. A. Okolnishnikova, Lower bounds for branching programs computing characteristic functions of binary codes, Metody Discretnogo Analiza 51 (1991) 61-83 (in Russian).
16. A.A. Razborov, Lower bounds for deterministic and nondeterministic branching programs, in: Proc. FCT'91, Lecture Notes in Computer Science, vol. 529, Springer, Berlin, 1991, pp. 47-60.
17. P. Savický, S. Zak, A lower bound on branching programs reading some bits twice, Theoret. Computer Sci. 172 (1997) 293-301.
18. D. Sieling, New lower bounds and hierarchy results for restricted branching programs, J. Comput. System Sci. 53 (1) (1996) 79-87.
19. D. Sieling, I. 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, pp. 359-370.
20. I. Wegener, The Complexity of Boolean Functions, Wiley-Teubner, New York, 1987.
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. MFCS'84, Lecture Notes in Computer Science, vol. 176, Springer, Berlin, 1984, pp. 562-566.
23. 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.