Complexity Theoretical Results for Randomized Branching Programs (1998)

Cached

Download Links

by Martin Sauerhoff
Citations:9 - 8 self

Active Bibliography

2 Approximation of Boolean Functions by Combinatorial Rectangles – Martin Sauerhoff - 2000
2 Ordered Binary Decision Diagrams and Minimal Trellises – John Lafferty, Alexander Vardy - 1999
45 Bottom-Up Induction of Oblivious Read-Once Decision Graphs – Ron Kohavi - 1994
4 Ordered Binary Decision Diagrams and Their Significance in Computer-Aided Design of VLSI Circuits -- a Survey – Christoph Meinel , Thorsten Theobald - 1998
19 On the Power of Randomized Branching Programs – Farid Ablayev , Marek Karpinski - 1996
18 The Nonapproximability of OBDD Minimization – Detlef Sieling - 1998
5 A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs – Farid Ablayev , Marek Karpinski - 1998
13 An algebraic approach to communication complexity – Pascal Tesson - 1998
12 On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions – Martin Sauerhoff - 1999
151 An Information Statistics Approach to Data Stream and Communication Complexity – Ziv Bar-yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar - 2003
4 On Nondeterminism versus Randomness for Read-Once Branching Programs – Martin Sauerhoff - 1997
15 A Lower Bound for Randomized Read-k-Times Branching Programs – Martin Sauerhoff - 1997
37 Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's – Jordan Gergov, Christoph Meinel - 1993
Ordered Binary Decision Diagrams and the Shannon Effect – Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
50 The History and Status of the P versus NP Question – Michael Sipser, Juris Hartmanis - 1992
57 Lower Bounds for Deterministic and Nondeterministic Branching Programs – Alexander A. Razborov - 1991
Spatial Entropy -- A Unified Attribute to Model Dynamic Communication in VLSI Circuits – Suresh Rajgopal - 1992
11 Classical versus Quantum Communication Complexity – Amnon Ta-Shma, Lane A. Hemaspaandra - 1999
126 Quantum vs. classical communication and computation – Harry Buhrman, Richard Cleve, Avi Wigderson - 1998