Lower bounds for randomized read-k-times branching programs (extended abstract)

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

Volumn 1373 LNCS, Issue , 1998, Pages 105-115

  Sauerhoff, Martin ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCHING PROGRAMS; COMPLEXITY THEORY; EXTENDED ABSTRACTS; LOWER BOUNDS; POLYNOMIAL SIZE; PROBABILISTIC COMPUTATION; PROBABILISTIC MODELS; PROBABILITY AMPLIFICATION; READ-ONCE BRANCHING PROGRAMS; WORST-CASE ERRORS;

COMPUTER SCIENCE; TURING MACHINES;

EXPONENTIAL FUNCTIONS;

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

References (16)

1. F. Ablayev. Randomization and nondeterminism are incomparable for polynomial ordered binary decision diagrams. In Proc. of ICALP, LNCS 1256, 195-202. Springer, 1997.
2. F. Ablayev and M. Karpinski. On the power of randomized branching programs. In Proc. of ICALP, LNCS 1099, 348-356. Springer, 1996.
3. L. Bahai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In Proc. of the 27th IEEE Symp. on Foundations of Computer Science, 337-347, 1986.
4. A. Borodin, A. A. Razborov, and R. Smolensky. On lower bounds for read-k-times-branching programs. Computational Complexity, 3:1-18, 1993.
5. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Computers, C-35(8):677-691, Aug. 1986.
6. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput., 17(2):230-261, Apr. 1988.
7. J. Gill. Probabilistic Turing Machines and Complexity of Computations. Ph.D. dissertation, U. C. Berkeley, 1972.
8. S. Jukna, A. Razborov, P. Savický, and I. Wegener. On P versus NP ∩ coNP for decision diagrams and read-once branching programs. In Proc. of the 22th Int. Symp. on Mathematical Foundations of Computer Science (MFCS), LNCS 1295, 319-326. Springer, 1997. Submitted to Computational Complexity.
9. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
10. C. Meinel. The power of polynomial size Ω-branching programs. In Proc. of the 5th Ann. ACM Symp. on Theoretical Aspects of Computer Science, LNCS 294, 81-90. Springer, 1988.
11. E. A. Okolnishnikova. On lower bounds for branching programs. Siberian Advances in Mathematics, 3(1):152-166, 1993.
12. C. H. Papadimitriou and M. Sipser. Communication complexity. In Proc. of the 14th Ann. ACM Symp. on Theory of Computing, 196-200, 1982.
13. A. A. Razborov. Lower bounds for deterministic and nondeterministic branching programs. In Proc. of Fundamentals of Computation Theory, LNCS 529, 47-60. Springer, 1991.
14. M. Sauerhoff. A lower bound for randomized read-k-times branching programs. Technical Report TR97-019, Electronic Colloquium on Computational Complexity, 1997. Available via WWW from http://www.eccc.uni-trier.de/.
15. M. Sauerhoff. On non-determinism versus randomness for read-once branching programs. Technical Report TR97-030, Electronic Colloquium on Computational Complexity, 1997. Available via WWW from http://www.eccc.uni- trier.de/.
16. A. C. Yao. Lower bounds by probabilistic arguments. In Proc. of the 24th IEEE Symp. on Foundations of Computer Science, 420-428, 1983.