Low-degree tests at large distances
From MaRDI portal
Publication:3549650
Recommendations
Cited in
(37)- Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm
- General systems of linear forms: equidistribution and true complexity
- Quantitative inverse theorem for Gowers uniformity norms \(\mathsf{U}^5\) and \(\mathsf{U}^6\) in \(\mathbb{F}_2^n\)
- Further cryptographic properties of the multiplicative inverse function
- Approximately symmetric forms far from being exactly symmetric
- Finite field models in arithmetic combinatorics -- ten years on
- A novel GPU-based implementation of the cube attack
- Query-efficient dictatorship testing with perfect completeness
- Some recent results on local testing of sparse linear codes
- The inverse conjecture for the Gowers norm over finite fields in low characteristic
- Hard functions for low-degree polynomials over prime fields
- Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
- Limits on the Rate of Locally Testable Affine-Invariant Codes
- Linear and quadratic uniformity of the Möbius function over $\mathbb{F}_{q}[t]$
- Quadratic Goldreich-Levin theorems
- A high dimensional Goldreich-Levin theorem
- Hard functions for low-degree polynomials over prime fields
- An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- A generalization of a theorem of Rothschild and van Lint
- Large values of the Gowers-Host-Kra seminorms
- Equivalence of polynomial conjectures in additive combinatorics
- Algebraic testing and weight distributions of codes.
- The structure theory of set addition revisited
- Low Rate Is Insufficient for Local Testability
- Non-Malleable Codes from Additive Combinatorics
- Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
- Limitation on the Rate of Families of Locally Testable Codes
- An additive combinatorics approach relating rank to communication complexity
- Quadratic Goldreich-Levin theorems
- An inverse theorem for the uniformity seminorms associated with the action of \(\mathbb F_p^\infty\)
- A generalization of a theorem of Rothschild and van Lint
- A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds
- New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
- Optimal computational split-state non-malleable codes
- Non-classical polynomials and the inverse theorem
- Approximate cohomology
This page was built for publication: Low-degree tests at large distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549650)
