Near-Optimal Time-Space Tradeoff for Element Distinctness
From MaRDI portal
Recommendations
Cited in
(17)- Two time-space tradeoffs for element distinctness
- Time-space tradeoffs for set operations
- Time-space tradeoffs for satisfiability
- Lower bounds on the complexity of recognizing SAT by Turing machines
- Bounds for the Element Distinctness Problem on one-tape Turing machines
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
- Determinism versus nondeterminism for linear time RAMs with memory restrictions
- Tight time-space lower bounds for finding multiple collision pairs and their applications
- Computing (and Life) Is All about Tradeoffs
- A general Sequential Time-Space Tradeoff for Finding Unique Elements
- Finding the Median (Obliviously) with Bounded Space
- On Ajtai's lower bound technique for R-way branching programs and the Hamming distance problem
- scientific article; zbMATH DE number 3980480 (Why is no real title available?)
- A Time-Space Tradeoff for Element Distinctness
- scientific article; zbMATH DE number 2119639 (Why is no real title available?)
- Substring complexity in sublinear space
- Quantum time-space tradeoff for finding multiple collision pairs
This page was built for publication: Near-Optimal Time-Space Tradeoff for Element Distinctness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4312417)
