Small-doubling subsets of F_2^n can now be covered by an explicit, efficiently learned subspace in polynomial time, with matching query lower bounds for classical and quantum algorithms.
Asadi, Alexander Golovnev, Tom Gur, and Igor Shinkar
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Algorithmic Polynomial Freiman-Ruzsa Theorems
Small-doubling subsets of F_2^n can now be covered by an explicit, efficiently learned subspace in polynomial time, with matching query lower bounds for classical and quantum algorithms.