The following pages link to (Q3549650):
Displaying 31 items.
- Large values of the Gowers-Host-Kra seminorms (Q351328) (← links)
- Equivalence of polynomial conjectures in additive combinatorics (Q377805) (← links)
- The inverse conjecture for the Gowers norm over finite fields in low characteristic (Q434231) (← links)
- Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\) (Q633234) (← links)
- Further cryptographic properties of the multiplicative inverse function (Q2057606) (← links)
- An inverse theorem for the uniformity seminorms associated with the action of \(\mathbb F_p^\infty\) (Q2379372) (← links)
- Approximate cohomology (Q2413232) (← links)
- Finite field models in arithmetic combinatorics -- ten years on (Q2512891) (← links)
- Optimal Computational Split-state Non-malleable Codes (Q2799103) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm (Q3182964) (← links)
- Breaking the ε-Soundness Bound of the Linearity Test over GF(2) (Q3541815) (← links)
- Low Rate Is Insufficient for Local Testability (Q3588425) (← links)
- NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR (Q4604480) (← links)
- Non-Malleable Codes from Additive Combinatorics (Q4637777) (← links)
- The structure theory of set addition revisited (Q4918444) (← links)
- Limitation on the Rate of Families of Locally Testable Codes (Q4933361) (← links)
- Query-Efficient Dictatorship Testing with Perfect Completeness (Q4933378) (← links)
- Some Recent Results on Local Testing of Sparse Linear Codes (Q4933384) (← links)
- Non-classical polynomials and the inverse theorem (Q5043348) (← links)
- A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds (Q5211009) (← links)
- LINEAR AND QUADRATIC UNIFORMITY OF THE MÖBIUS FUNCTION OVER (Q5227711) (← links)
- An Additive Combinatorics Approach Relating Rank to Communication Complexity (Q5501927) (← links)
- Approximately symmetric forms far from being exactly symmetric (Q5885197) (← links)
- An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm (Q5891800) (← links)
- A generalization of a theorem of Rothschild and van Lint (Q5918630) (← links)
- A generalization of a theorem of Rothschild and van Lint (Q5925692) (← links)
- General systems of linear forms: equidistribution and true complexity (Q5965073) (← links)
- A Novel GPU-Based Implementation of the Cube Attack (Q6487203) (← links)
- Quantitative inverse theorem for Gowers uniformity norms \(\mathsf{U}^5\) and \(\mathsf{U}^6\) in \(\mathbb{F}_2^n\) (Q6622787) (← links)
