Classical and quantum polynomial Freiman-Ruzsa algorithms
From MaRDI portal
Cites work
- An additive combinatorics approach relating rank to communication complexity
- An equivalence between inverse sumset theorems and inverse conjectures for the \(U^{3}\) norm
- Cubic Goldreich-Levin
- Equivalence of polynomial conjectures in additive combinatorics
- From affine to two-source extractors via approximate duality
- scientific article; zbMATH DE number 4014838 (Why is no real title available?)
- scientific article; zbMATH DE number 1315276 (Why is no real title available?)
- Large values of the Gowers-Host-Kra seminorms
- Low-degree tests at large distances
- New bounds for matching vector families
- Non-malleable codes from additive combinatorics (extended abstract)
- On a conjecture of Marton
- Quadratic Goldreich-Levin theorems
- Quantum worst-case to average-case reductions for all linear problems
- Sampling-based proofs of almost-periodicity results and algorithmic applications
- Worst-case to average-case reductions via additive combinatorics
This page was built for publication: Classical and quantum polynomial Freiman-Ruzsa algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445519)