Approximation of Boolean Functions by Combinatorial Rectangles (2000)

View PDF

Download Links

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

Active Bibliography

8 Complexity Theoretical Results for Randomized Branching Programs – Martin Sauerhoff - 1998
714 The space complexity of approximating the frequency moments – Noga Alon, Yossi Matias, Mario Szegedy - 1996
640 Multiparty Communication Complexity – Danny Dolev, Tomás Feder - 1989
756 Pseudo-Random Generation from One-Way Functions – Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby - 1988
674 Models and issues in data stream systems – Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev Motwani, Jennifer Widom - 2002
196 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
2429 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
861 Applied Cryptography -- Protocols, Algorithms, and . . . – Bruce Schneier
1923 Randomized Algorithms – Rajeev Motwani - 1995