Approximation of Boolean Functions by Combinatorial Rectangles (2000)

Cached

Download Links

by Martin Sauerhoff
Venue:Electr. Coll. on Comp. Compl
Citations:2 - 2 self

Active Bibliography

9 Complexity Theoretical Results for Randomized Branching Programs – Martin Sauerhoff - 1998
13 An algebraic approach to communication complexity – Pascal Tesson - 1998
8 Communication-space tradeoffs for unrestricted protocols – Paul Beame, Martin Tompa, Peiyuan Yan - 1994
15 A Lower Bound for Randomized Read-k-Times Branching Programs – Martin Sauerhoff - 1997
Lower Bounds in . . . Learning Theory via Analytic Methods – Alexander Alexandrovich Sherstov - 2009
189 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
12 On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions – Martin Sauerhoff - 1999
29 The Communication Complexity of Threshold Gates – Noam Nisan - 1994
31 Time-Space Tradeoff Lower Bounds for Randomized Computation of Decision Problems – Paul Beame, Michael Saks, Xiaodong Sun, Erik Vee - 2000
19 Rectangle Size Bounds and Threshold Covers in Communication Complexity – Hartmut Klauck - 2003
2 Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables – Martin Sauerhoff - 1999
1 On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs – Beate Bollig, Martin Sauerhoff, Ingo Wegener
\StopWatchEnd \Taschenuhr \VarTaschenuhr – Alexander A. Sherstov, Summa Cum Laude
61 On Randomized One-Round Communication Complexity – Ilan Kremer, Noam Nisan, Dana Ron - 1995
5 Bridges between Algebraic Automata Theory and Complexity Theory – Pascal Tesson, Denis Thérien
19 On the Power of Randomized Branching Programs – Farid Ablayev , Marek Karpinski - 1996
Learning Theory via Analytic Methods – Alexander Alexandrovich Sherstov, Adam R. Klivans, Anna Gál, C. Gregory Plaxton, Alexander A. Razborov, David Zuckerman, Lower Bounds, Communication Complexity, Er Alex, Rovich Sherstov - 1923
11 Classical versus Quantum Communication Complexity – Amnon Ta-Shma, Lane A. Hemaspaandra - 1999
156 An Information Statistics Approach to Data Stream and Communication Complexity – Ziv Bar-yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar - 2003