On the power of randomized branching programs

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

Volumn 1099, Issue , 1996, Pages 348-356

  Ablayev, Farid ^a   Karpinski, Marek ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

BRANCHING PROGRAMS; POLYNOMIAL SIZE; READ-ONCE BRANCHING PROGRAMS;

POLYNOMIALS;

EID: 84947728444     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_141     Document Type: Conference Paper

References (20)

1. F. Ablayev, Lower bounds for probabilistic space complexity: communication-automata approach, in Proceedings of the LFCS'94, Lecture Notes in Computer Science, Springer-Verlag, 813, (1994), 1-7.
2. L. Adelman, Two theorems on random polynomial time, in Proceedings of the 19-th FOCS, (1978), 75-83.
3. M. Ajtai and M. Ben-Or, A theorem on randomized constant depth circuits, in Proceedings of the 16-th STOC, (1984), 471-474.
4. Awith probability 1, SIAM J. Comput, 10, (1981), 96-113.
5. В. Boiling, M. Sauerhoff, D. Sieling, and I. Wegener, On the power of different types of restricted branching programs, ECCC Reports 1994, TR94-025.
6. R. Boppana and M. Sipser, The complexity of finite functions, in Handbook of Theoretical Computer Science, Vol A: Algorithms and Complexity, MIT Press and Elsevier, The Netherlands, 1990, ed. J Van Leeuwen, 757-804.
7. A. Borodin, A. Razborov, and R. Smolensky, On lower bounds for read-fc-times branching programs, Computational Complexity, 3, (1993), 1-18.
8. A. Borodin, Time-space tradeoffs (getting closer to barrier?), in Proceedings of the ISAAC'93, Lecture Notes in Computer Science, Springer-Verlag, 762, (1993), 209-220.
9. R. Bryant, Symbolic boolean manipulation with ordered binary decision diagrams, ACM Computing Surveys, 24, No. 3, (1992), 293-318.
10. R. Frevalds, Fast probabilistic algorithms, in Proceedings of the Conference Mathematical Foundation of Computer Science 1979, Lecture Notes in Computer Science, Springer-Verlag, 74, (1979), 57-69.
11. R. Freivalds and M. Karpinski, Lower time bounds for randomized computation, in Proceedings of the ICALP'95, Lecture Notes in Computer Science, Springer-Verlag, 944, (1995), 183-195.
12. M. Krause, Lower bounds for depth-restricted branching programs, Information and Computation, 91, (1991), 1-14.
13. C. Y. Lee, Representation of switching circuits by binary-decision programs, Bell System Technical Journal, 38, (1959), 985-999.
14. L. Lovasz, Communication complexity: a survey, in "Paths, Flows and VLSI Layout", Korte, Lovasz, Proemei, Schrijver Eds., Springer- Verlag (1990), 235-266.
15. W. Masek, A fast algorithm for the string editing problem and decision graph complexity, M.Sc. Thesis, Massachusetts Institute of Technology, Cambridge, May 1976.
16. S. Ponzio, A lower bound for integer multiplication with read-once branching programs, Proceedings of the 27-th STOC, (1995), 130-139.
17. A. Razborov, Lower bounds for deterministic and nondeterministic branching programs, in Proceedings of the FCT'91, Lecture Notes in Computer Science, Springer- Verlag, 529, (1991), 47-60.
18. J. Simon and M. Szegedy, A new lower bound theorem for read-only-once branching programs and its applications, Advances in Computational Complexity Theory, ed. Jin-Yi Cai, DIMACS Series, 13, AMS (1993), 183-193.
19. I. Wegener, The complexity of Boolean functions. Wiley-Teubner Series in Comp. Sei., New York - Stuttgart, 1987.
20. I. Wegener, Efficient data structures for boolean functions, Discrete Mathematics, 136, (1994), 347-372.