Complexity Theoretical Results for Randomized Branching Programs (1998)

Cached

Download Links

by Martin Sauerhoff
Citations:9 - 8 self

Documents Related by Co-Citation

152 Branching programs and binary decision diagrams: theory and applications – I Wegener - 2000
614 Multiparty Communication Complexity – Danny Dolev, Tomás Feder - 1989
50 On Lower Bounds for Read-k-Times Branching Programs – Allan Borodin, Alexander A. Razborov, Roman Smolensky - 1993
55 A non-linear time lower bound for boolean branching programs – Miklós Ajtai - 1999
57 Lower Bounds for Deterministic and Nondeterministic Branching Programs – Alexander A. Razborov - 1991
18 On lower bounds for branching programs – E A Okol’nishnikova - 1993
44 Time-Space Tradeoffs for Branching Programs – Paul Beame, Michael Saks, Jayram S. Thathachar - 1999
28 Time-Space Tradeoff Lower Bounds for Randomized Computation of Decision Problems – Paul Beame, Michael Saks, Xiaodong Sun, Erik Vee - 2000
46 Communication Complexity and Parallel Computing – J Hromkovic - 2010
12 On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions – Martin Sauerhoff - 1999
37 Determinism versus Non-Determinism for Linear Time RAMs with Memory Restrictions – Miklos Ajtai - 1998
84 Private vs. Common Random bits in Communication Complexity – Ilan Newman - 1995
56 On Randomized One-Round Communication Complexity – Ilan Kremer, Noam Nisan, Dana Ron - 1995
6 Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching – J Hromkovič, M Sauerhoff
2350 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
10 Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction – Masaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara - 2000
8 Quantum and stochastic branching programs of bounded width – Farid Ablayev, Cristopher Moore, Christopher Pollett - 2002
8 On the computational power of quantum branching programs – Farid Ablayev, Aida Gainutdinova, Marek Karpinski - 2001
22 Space-Bounded Quantum Complexity – John Watrous - 1999