Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation (2000)

Cached

Download Links

by Paul Beame , Michael Saks , Xiaodong Sun , Erik Vee
Citations:33 - 0 self

Documents Related by Co-Citation

53 A non-linear time lower bound for boolean branching programs – Miklós Ajtai - 1999
135 Branching Programs and Binary Decision Diagrams—Theory and Applications – I Wegener - 2000
36 Determinism versus Non-Determinism for Linear Time RAMs with Memory Restrictions – Miklos Ajtai - 1998
41 Time-Space Tradeoffs for Branching Programs – Paul Beame, Michael Saks, Jayram S. Thathachar - 1999
52 A time-space tradeoff for sorting on a general sequential model of computation – A. Borodin, S. Cook - 1982
26 Meanders and their applications in lower bounds arguments – N Alon, W Maass - 1988
224 On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication – Randal E. Bryant - 1998
49 On Lower Bounds for Read-k-Times Branching Programs – Allan Borodin, Alexander A. Razborov, Roman Smolensky - 1993
8 Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication – B Bollig - 2000
43 Graph driven BDDs -- a new data structure for Boolean functions – D Sieling, I Wegener - 1995
536 Multiparty Communication Complexity – Danny Dolev, Tomás Feder - 1989
18 Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems – Paul Beame, Erik Vee - 2002
6 Graph-driven free parity BDDs: algorithms and lower bounds – H Brosenne, M Homeister, S Waack - 2001
14 Time-space tradeoffs for integer multiplication on various types of input oblivious sequential machines – J Gergov - 1994
11 Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing – Philipp Woelfel - 2005
10 A read-once branching program lower bound of Ω(2 n/4 ) for integer multiplication using universal hashing – B Bollig, P Woelfel - 2001
33 A Lower Bound For Integer Multiplication With Read-Once Branching Programs – Stephen Ponzio, Siam J. Comput C - 1998
24 A General Sequential Time-Space Tradeoff for Finding Unique Elements – Paul Beame - 1991
40 Communication Complexity and Parallel Computing – J Hromkovič - 1997