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

55 A non-linear time lower bound for boolean branching programs – Miklós Ajtai - 1999
152 Branching programs and binary decision diagrams: theory and applications – I Wegener - 2000
37 Determinism versus Non-Determinism for Linear Time RAMs with Memory Restrictions – Miklos Ajtai - 1998
44 Time-Space Tradeoffs for Branching Programs – Paul Beame, Michael Saks, Jayram S. Thathachar - 1999
55 A time-space tradeoff for sorting on a general sequential model of computation – A. Borodin, S. Cook - 1982
233 On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication – Randal E. Bryant - 1998
50 On Lower Bounds for Read-k-Times Branching Programs – Allan Borodin, Alexander A. Razborov, Roman Smolensky - 1993
29 Meanders and their applications in lower bounds arguments – N ALON, W MAASS - 1988
57 Lower Bounds for Deterministic and Nondeterministic Branching Programs – Alexander A. Razborov - 1991
614 Multiparty Communication Complexity – Danny Dolev, Tomás Feder - 1989
10 A read-once branching program lower bound of Ω(2 n/4 ) for integer multiplication using universal hashing – B Bollig, P Woelfel - 2001
13 Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing – Philipp Woelfel - 2005
8 Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication – B Bollig - 2000
15 Time-space tradeoffs for integer multiplication on various types of input oblivious sequential machines – J Gergov - 1994
34 A Lower Bound For Integer Multiplication With Read-Once Branching Programs – Stephen Ponzio, Siam J. Comput C - 1998
27 A General Sequential Time-Space Tradeoff for Finding Unique Elements – Paul Beame - 1991
43 Graph driven BDDs -- a new data structure for Boolean functions – D Sieling, I Wegener - 1995
351 The Complexity of Boolean Functions – Ingo Wegener - 1987
42 The recognition problem for the set of perfect squares – A Cobham - 1966