Paul Beame, Michael Saks, Xiaodong Sun, Erik Vee  Home/Search
Context Related
Links: ACM DBLP | eccc.unitrier.de/ecccrepor...Paper.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: eccc.unitrier.de/pub/ecc...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We prove the first time-space lower bound tradeoffs for randomized computation of decision problems. The bounds hold even in the case that the computation is allowed to have arbitrary probability of error on a small fraction of inputs. Our techniques are an extension of those used by Ajtai [Ajt99a, Ajt99b] in his time-space tradeoffs for deterministic RAM algorithms computing element distinctness and for Boolean branching programs computing a natural quadratic form. Ajtai's bounds were of the... (Update)
Context of citations to this paper: More
.... exponential lower bounds for nondeterministic read once programs have been proven for a class of functions based on quadratic forms in [3 5]. In the deterministic case, the recent celebrated result of Ajtai [1] gives a truly exponential lower bound for a function similar to...
...1. INTRODUCTION Recently, the first non trivial time space tradeoff lower bounds have been shown for decision problems in P [7, 1, 2, 6]. These results are the culmination of almost two decades of analysis of branching programs, natural generalizations of decision trees to...
Cited by: More
Triangle-Freeness is Hard to Detect - Jukna, Schnitger (2002) (Correct)
On Memory-Bound Functions for Fighting Spam - Dwork, Goldberg, Naor (2003) (Correct)
Time-Space Tradeoffs, Multiparty Communication Complexity, and.. - Beame, Vee (Correct)
Similar documents (at the sentence level):
41.9%: Super-Linear Time-Space Tradeoff Lower Bounds for Randomized .. - Beame, Saks, al. (2000) (Correct)
7.5%: Time-Space Tradeoff Lower Bounds for Randomized.. - Beame, Saks, Sun, Vee (Correct)
Active bibliography (related documents): More All
1.0: Time-Space Tradeoffs for Branching Programs - Beame, Saks, Thathachar (1999) (Correct)
0.5: The Computational Complexity of Universal Hashing - Mansour, Nisan, Tiwari (2002) (Correct)
0.5: Time-Space Tradeoffs in Algebraic Complexity - Aldaz, Matera, Montaña, .. (Correct)
Similar documents based on text: More All
0.4: On the Complexity of Unsatisfiability Proofs for Random .. - Beame, Karp, Pitassi.. (1997) (Correct)
0.4: The efficiency of resolution and Davis-Putnam procedures - Beame, Karp, Pitassi (1999) (Correct)
0.3: Research Statement - Sun (Correct)
Related documents from co-citation: More All
9: A non-linear time lower bound for Boolean branching programs - Ajtai - 1999
8: Determinism versus non-determinism for linear time RAMs with memory restrictions - Ajtai - 1998
6: Timespace tradeoffs for branching programs - Beame, Saks et al. - 1998
BibTeX entry: (Update)
P. Beame, M. Saks, X. Sun, and E. Vee. Super-linear time-space tradeoff lower bounds for randomized computation. In Proceedings of 41st FOCS, 2000. To appear. Available at ECCC TR00--025. http://citeseer.ist.psu.edu/article/beame00superlinear.html More
@inproceedings{ beame00superlinear,
author = "Paul Beame and Michael E. Saks and Xiaodong Sun and Erik Vee",
title = "Super-linear time-space tradeoff lower bounds for randomized computation",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "169--179",
year = "2000",
url = "citeseer.ist.psu.edu/article/beame00superlinear.html" }
Citations (may not include all citations):68 On lower bounds for read-k times branching programs (context) - Borodin, Razborov et al. - 1993
66 Complexity classes in communication complexity theory (context) - aszl, Babai et al. - 1986
66 On simultaneous resource bounds (context) - Pippenger - 1979
57 The probabilistic communication complexity of set intersecti.. (context) - Kalyanasundaram, Schnitger - 1987 ACM DBLP
50 the distributional complexity of disjointness (context) - Razborov - 1990
37 The computational complexity of universal hashing - Mansour, Nisan et al. - 1993 ACM DBLP
25 A non-linear time lower bound for boolean branching programs - Ajtai - 1999 ACM DBLP
23 Determinism versus non-determinism for linear time RAMs with.. - Ajtai - 1999 DBLP
23 Determinism versus non-determinism for linear time RAMs with.. - Ajtai - 1998 DBLP
21 The recognition problem for the set of perfect squares (context) - Cobham - 1966 DBLP
17 getting closer to the barrier (context) - Borodin, tradeo - 1993
11 Nondeterministic polynomial time versus nondeterministic log.. - Fortnow - 1997
9 A time-space tradeo for sorting on a general sequential mod.. (context) - Borodin, Cook - 1982
8 Friedhelm Meyer auf der Heide (context) - Borodin, Fich - 1987
8 Time-space tradeo s for branching programs (context) - Beame, Saks et al. - 1998
4 Near-optimal time-space tradeo for element distinctness (context) - Yao - 1988
3 A time-space tradeo for sorting on non-oblivious machines (context) - Borodin, Fischer et al. - 1981
3 Time-space tradeo s for nondeterministic computation (context) - Fortnow, van Melkebeek - 2000
3 A time-space tradeo for Boolean matrix multiplication (context) - Abrahamson - 1990
1 for algebraic problems on general sequential models (context) - Abrahamson - 1991
1 Time-space tradeo s for sat (context) - Lipton, Viglas - 1999
1 A general time-space tradeo for nding unique elements (context) - Beame - 1991
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC