Randomness versus nondeterminism for read-once and read-k branching programs

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

Volumn 2607, Issue , 2003, Pages 307-318

  Sauerhoff, Martin ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; RANDOM PROCESSES;

BOUNDED ERRORS; BRANCHING PROGRAMS; LOWER BOUNDS; N-VERTEX GRAPH; NON-DETERMINISM; POLYNOMIAL SIZE; POSITIVE CONSTANT; WEIGHTED SUM;

ERRORS;

EID: 27644465326     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_28     Document Type: Article

References (25)

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. M. Ajtai. Determinism versus non-determinism for linear time RAMs with memory restrictions. In Proc. of 31st STOC, 632-641, 1999.
3. M. Ajtai. A non-linear time lower bound for boolean branching programs. In Proc. of 40th FOCS, 60-70, 1999.
4. L. Babai. The Fourier transform and equations over finite abelian groups. Lecture Notes, version 1.2, Dec. 1989.
5. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In Proc. of 27th FOCS, 337-347, 1986.
6. P. Beame, T. S. Jayram, and M. Saks. Time-space tradeoffs for branching programs. Journal of Computer and System Sciences, 63(4):542-572, 2001.
7. P. Beame, M. Saks, X. Sun, and E. Vee. Super-linear time-space tradeoff lower bounds for randomized computation. In Proc. of 41st FOCS, 169-179, 2000.
8. P. Beame and E. Vee. Time-space tradeoffs, multiparty communication complexity, and nearest neighbor problems. In Proc. of 34th STOC, 688-697, 2002.
9. B. Bollig, M. Sauerhoff, I. Wegener. On the nonapproximability of boolean functions by OBDDs and read-k-times branching programs. Information and Computation, 178:263-278, 2002.
10. A. Borodin, A. A. Razborov, and R. Smolensky. On lower bounds for read-k-times branching programs. Computational Complexity, 3:1-18, 1993.
11. P. Duriš, J. Hromkovič, S. Jukna, M. Sauerhoff, and G. Schnitger. On multipartition communication complexity. In Proc. of 18th STACS, LNCS 2010, 206-217. Springer, 2001.
12. J. Hromkovič and M. Sauerhoff. Tradeoffs between nondeterminism and complexity for communication protocols and branching programs. In Proc. of 17th STACS, LNCS 1770, 145-156. Springer, 2000.
13. S. Jukna and G. Schnitger. On multi-partition communication complexity of triangle-freeness. Combinatorics, Probability & Computing 11(6):549-569, 2002.
14. I. Kremer, N. Nisan, and D. Ron. On randomized one-round communication complexity. Computational Complexity, 8(1):21-49, 1999.
15. I. Newman. Private vs. common random bits in communication complexity. Information Processing Letters, 39(2):67-71, 1991.
16. E. A. Okol'nishnikova. On lower bounds for branching programs. Siberian Advances in Mathematics, 3(1):152-166, 1993.
17. M. Sauerhoff. Lower bounds for randomized read-k-times branching programs. In Proc. of 15th STACS, LNCS 1373, 105-115. Springer, 1998.
18. M. Sauerhoff. Complexity Theoretical Results for Randomized Branching Programs. PhD thesis, Univ. Dortmund. Shaker, Aachen, 1999.
19. M. Sauerhoff. Approximation of boolean functions by combinatorial rectangles. ECCC, Technical Report 58, 2000.
20. To appear in Theoretical Computer Science.
21. M. Sauerhoff. On the size of randomized OBDDs and read-once branching programs for k-stable functions. Computational Complexity, 10:155-178, 2001.
22. P. Savický and S. Žák. A read-once lower bound and a (1, +k)-hierarchy for branching programs. Theoretical Computer Science, 238(1-2):347-362, 2000.
23. J. Simon and M. Szegedy. A new lower bound theorem for read-only-once branching programs and its applications. In J.-J. Cai, editor, Advances in Computational Complexity Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 13, 183-193. American Mathematical Society, 1993.
24. J. Thathachar. On separating the read-k-times branching program hierarchy. In Proc. of 30th STOC, 653-662, 1998.
25. I. Wegener. Branching Programs and Binary Decision Diagrams - Theory and Applications. Monographs on Discrete and Applied Mathematics. SIAM, Philadelphia, PA, 2000.