Parallel algorithm for matroid basis computation with O(n^{1/3} log^{1/3} n) round complexity, nearly matching the KUW lower bound.
[PRR06] Michal Parnas, Dana Ron, and Ronitt Rubinfeld
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Quantum algorithms achieve poly(k) query complexity for tolerant k-junta testing with ε1 = 1/2-1/k and ε2 = 1/2-1/(2k²), while classical algorithms require k^Ω(log k) queries.
citing papers explorer
-
Quantum Advantage in Tolerant Junta Testing
Quantum algorithms achieve poly(k) query complexity for tolerant k-junta testing with ε1 = 1/2-1/k and ε2 = 1/2-1/(2k²), while classical algorithms require k^Ω(log k) queries.