The power of nondeterminism and randomness for oblivious branching programs

Theory of Computing Systems

Volumn 36, Issue 2, 2003, Pages 159-182

  Hromkovič, Juraj ^a   Sauerhoff, Martin ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

NONDETERMINISM;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; POLYNOMIALS;

RANDOM PROCESSES;

EID: 0038819463     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-002-1050-x     Document Type: Article

References (37)

1. F. Ablayev. Randomization and nondeterminism are incomparable for polynomial ordered binary decision diagrams. In Proc. of 24th ICALP, pp. 195-202. LNCS 1256. Springer-Verlag, Berlin, 1997.
2. F. Ablayev and M. Karpinski. On the power of randomized branching programs. In Proc. of 23rd ICALP, pp. 348-356. LNCS 1099. Springer-Verlag, Berlin, 1996.
3. M. Ajtai. Determinism versus non-determinism for linear time RAMs with memory restrictions. In Proc. of 31st STOC, pp. 632-641, 1999.
4. M. Ajtai. A non-linear time lower bound for boolean branching programs. In Proc. of 40th FOCS, pp. 60-70, 1999.
5. N. Alon and W. Maass. Meanders and their applications in lower bounds arguments. Journal of Computer and System Sciences, 37:118-129, 1988.
6. L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols, pseudorandom generators for logspace and time-space trade-offs. Journal of Computer and System Sciences, 45:204-232, 1992.
7. P. Beame, M. Saks, X. Sun, and E. Vee. Super-linear time-space tradeoff lower bounds for randomized computation. In Proc. of 41 st FOCS, pp. 169-179, 2000.
8. P. Beame, M. Saks, and J. S. Thathachar. Time-space tradeoffs for branching programs. In Proc. of 39th FOCS, pp. 254-263, 1998.
9. P. Beame and E. Vee. Time-space tradeoffs, multiparty communication complexity, and nearest neighbor problems. In Proc. of 34th STOC, pp. 688-697, 2002.
10. B. Bollig, M. Sauerhoff, D. Sieling, and I. Wegener. Hierarchy theorems for kOBDDs and kIBDDs. Theoretical Computer Science, 205(1):45-60, 1998.
11. B. Bollig and I. Wegener. Complexity theoretical results for partitioned (nondeterministic) binary decision diagrams. In Proc. of 22nd MFCS, pp. 159-168. LNCS 1295. Springer-Verlag, Berlin, 1997.
12. A. Borodin, A. A. Razborov, and R. Smolensky. On lower bounds for read-k-times branching programs. Computational Complexity, 3:1-18, 1993.
13. P. Ďurlš and Z. Galil. On the power of multiple reads in a chip. Information and Computation, 104:277-287, 1993.
14. J. Gergov. Time-space tradeoffs for integer multiplication on various types of input oblivious sequential machines. Information Processing Letters, 51:265-269, 1994.
15. J. Hromkovič. Communication Complexity and Parallel Computing. EATCS Texts in Theoretical Computer Science. Springer-Verlag, Berlin, 1997.
16. J. Hromkovič. Communication complexity and lower bounds on multilective computations. Theoretical Informatics and Applications (RAIRO), 33:193-212, 1999.
17. J. Hromkovič. Communication protocols - an exemplary study of the power of randomness. In S. Rajasekaran, P. M. Pardalos, J. H. Reif, and J. D. P. Rolin, editors, Handbook on Randomized Computing, Chapter 16. Kluwer, Dordrecht, 2001.
18. J. Hromkovič and G. Schnitger. On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata. Information and Computation, 169(2):284-296, 2001.
19. J. Jain, J. Bitner, J. A. Abraham, and D. S. Fussell. Functional partitioning for verification and related problems. In T. Knight and J. Savage, editors, Advanced Research in VLSI and Parallel Systems: Proceedings of the 1992 Brown/MIT Conference, pp. 210-226. MIT Press, Cambridge, MA, 1992.
20. S. P. Jukna. Lower bounds on communication complexity. Mathematical Logic and Its Applications, 5:22-30, 1987.
21. M. Krause. Lower bounds for depth-restricted branching programs. Information and Computation, 91(1):1-14, 1991.
22. M. Krause and S. Waack. On oblivious branching programs of linear length. Information and Computation, 94:232-249, 1991.
23. K. Kriegel and S. Waack. Lower bounds on the complexity of real-time branching programs. Theoretical Informatics and Applications (RAIRO), 22:447-459, 1988.
24. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, Cambridge, 1997.
25. K. Mehlhorn and E. Schmidt. Las-Vegas is better than determinism in VLSI and distributed computing. In Proc. of 14th STOC, pp. 330-337, 1982.
26. C. Meinel. Modified Branching Programs and Their Computational Power. LNCS 370. Springer-Verlag, Berlin, 1989.
27. C. Meinel. Polynomial size Ω-branching programs and their computational power. Information and Computation, 85:163-182, 1990.
28. I. Newman. Private vs. common random bits in communication complexity. Information Processing Letters, 39:67-71, 1991.
29. N. Nisan and A. Wigderson. Rounds in communication complexity revisited. SIAM Journal on Computing, 22:211-219, 1993.
30. A. A. Razborov. Lower bounds for deterministic and nondeterministic branching programs. In Proc. of FCT, pp. 47-60. LNCS 529. Springer-Verlag, Berlin, 1991.
31. M. Sauerhoff. Lower bounds for randomized read-k-times branching programs. In. Proc. of STAGS, pp. 105-115. LNCS 1373. Springer-Verlag, Berlin, 1998.
32. M. Sauerhoff. Complexity Theoretical Results for Randomized Branching Programs. Shaker, Aachen, 1999.
33. M. Sauerhoff. An improved hierarchy result for partitioned HDDs. Theory of Computing Systems, 33:313-329, 2000.
34. M. Sauerhoff. On the size of randomized OBDDs and read-once branching programs for k-stable functions. Computational Complexity, 10:155-178, 2001.
35. J. Thathachar. On separating the read-k-times branching program hierarchy. In Proc. of 30th STOC, pp. 653-662, 1998.
36. I. Wegener. Branching Programs and Binary Decision Diagrams - Theory and Applications. Monographs on Discrete and Applied Mathematics. SIAM, Philadelphia, PA, 2000.
37. A. C. Yao. Some complexity questions related to distributive computing. In Proc. of 11th STOC, pp. 209-213, 1979.