A time-space tradeoff for element distinctness
SIAM Journal on Computing
Meanders and their applications in lower bounds arguments
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
On the distributional complexity of disjointness
Proceedings of the seventeenth international colloquium on Automata, languages and programming
A general sequential time-space tradeoff for finding unique elements
SIAM Journal on Computing
Time-space tradeoffs for algebraic problems on general sequential machines
Journal of Computer and System Sciences
The computational complexity of universal hashing
Theoretical Computer Science - Special issue on structure in complexity theory
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
On lower bounds for read-k-times branching programs
Computational Complexity
Communication complexity
Determinism versus non-determinism for linear time RAMs (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Time-space tradeoffs for branching programs
Journal of Computer and System Sciences
Determinism versus nondeterminism for linear time RAMs with memory restrictions
Journal of Computer and System Sciences - STOC 1999
Time Space Tradeoffs (Getting Closer to the Barrier?)
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Time-Space Tradeoffs for Nondeterministic Computation
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Time-Space Tradeoffs for Branching Programs
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Non-Linear Time Lower Bound for Boolean Branching Programs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On multi-partition communication complexity
Information and Computation
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
Time-space lower bounds for satisfiability
Journal of the ACM (JACM)
On the capacity of information networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A hierarchy result for read-once branching programs with restricted parity nondeterminism
Theoretical Computer Science - Mathematical foundations of computer science 2000
Theoretical Computer Science
A note on the decoding complexity of error-correcting codes
Information Processing Letters
Lower bounds for randomized read/write stream algorithms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Expanders and time-restricted branching programs
Theoretical Computer Science
A nondeterministic space-time tradeoff for linear codes
Information Processing Letters
Comparison-based time-space lower bounds for selection
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
On multi-partition communication complexity
Information and Computation
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms (TALG)
Cracks in the defenses: scouting out approaches on circuit lower bounds
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Uniform derandomization from pathetic lower bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Pebbles and Branching Programs for Tree Evaluation
ACM Transactions on Computation Theory (TOCT)
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Determinism versus nondeterminism with arithmetic tests and computation: extended abstract
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Lower bounds for RAMs and quantifier elimination
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.01 |
We prove the first time-space lower bound trade-offs 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 extension of those used by Ajtai and by Beame, Jayram, and Saks that applied to deterministic branching programs. Our results also give a quantitative improvement over the previous results.Previous time-space trade-off results for decision problems can be divided naturally into results for functions with Boolean domain, that is, each input variable is {0,1}-valued, and the case of large domain, where each input variable takes on values from a set whose size grows with the number of variables.In the case of Boolean domain, Ajtai exhibited an explicit class of functions, and proved that any deterministic Boolean branching program or RAM using space S = o(n) requires superlinear time T to compute them. The functional form of the superlinear bound is not given in his paper, but optimizing the parameters in his arguments gives T = Ω(n log log n/log log log n) for S = O(n1−&epsis;). For the same functions considered by Ajtai, we prove a time-space trade-off (for randomized branching programs with error) of the form T = Ω(n &sqrt; log(n/S)/log log (n/S)). In particular, for space O(n1−&epsis;), this improves the lower bound on time to Ω(n&sqrt; log n/log log n).In the large domain case, we prove lower bounds of the form T = Ω(n&sqrt; log(n/S)/log log (n/S)) for randomized computation of the element distinctness function and lower bounds of the form T = Ω(n log (n/S)) for randomized computation of Ajtai's Hamming closeness problem and of certain functions associated with quadratic forms over large fields.