Randomization and nondeterminism are comparable for ordered read-onee branching programs

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

Volumn 1256, Issue , 1997, Pages 196-202

  Ablayev, Farid ^a  

^a KAZAN FEDERAL UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS;

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

BOOLEAN FUNCTIONS;

EID: 84951156230     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (16)

1. F Ablayev, Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science, 157, (1996), 139-159.
2. F. Ablayev and M. Karpinski, On the power of randomized branching programs, in Proceedings of the ICALP'96, Lecture Notes in Computer Science, Springer-Verlag, 1099, (1996), 348-356.
3. F. Ablayev and M. Karpinski, On the power of randomized branching programs, manuscript (generalization of ICALP'96 paper results for the case of pure boolean function), available at http://www.ksu.ru/~ablayev
4. R. Bryant, Symbolic boolean manipulation with ordered binary decision diagrams, ACM Computing Surveys, 24, No. 3, (1992), 293-318.
5. A. Borodin, A. Razborov, and R. Smolensky, On lower bounds for read-fc-times branching programs, Computational Complexity, 3, (1993), 1-18.
6. Y. Breitbart, H.Hunt III, and D. Rosenkratz, On the size of binary decision diagrams representing Boolean functions, Theoretical Computer Science, 145, (1995), 45-69.
7. J. Dias da Silva and Y. Hamidoune, Cyclic spaces for Grassmann derivatives and additive theory, Bull, London Math. Soc, 26, (1994), 140-146.
8. S. Ponsio, A lower bound for integer multiplication with read-once branching programs, Proceedings of the 27-th STOC, (1995), 130-139.
9. 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.
10. M. Sauerhoff, Lower bounds for the RP-OBDD-Size, manuscript, personal communication.
11. P. Savicky, S. Zak, A large lower bound for 1-branching programs, Electronic Colloquium on Computational Complexity, Revision 01 of TR96-036, (1996), available at http://wHw.eccc.uni-trier.de/eccc/
12. P. Savicky, S. Zak, A hierarchy for (1, +fc)-branching programs with respect to k, Electronic Colloquium on Computational Complexity, TR96-050, (1996), available at http://www.eccc.uni-trier.de/eccc/
13. 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, A MS (1993), 183-193.
14. I. Wegener, The complexity of Boolean functions. Wiley-Teubner Series in Comp. Sci., New York-Stuttgart, 1987.
15. I. Wegener, Efficient data structures for boolean functions, Discrete Mathematics, 136, (1994), 347-372.
16. A. C. Yao, Some Complexity Questions Related to Distributive Computing, in Proc. of the 11th Annual ACM Symposium on the Theory of Computing, (1979), 209-213.