Quadratic Goldreich-Levin Theorems
From MaRDI portal
Publication:5495034
DOI10.1109/FOCS.2011.59zbMath1292.94178arXiv1105.4372OpenAlexW2110935583MaRDI QIDQ5495034
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.4372
Linear codes (general theory) (94B05) Number-theoretic algorithms; complexity (11Y16) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items (3)
Finite field models in arithmetic combinatorics -- ten years on ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Mining circuit lower bound proofs for meta-algorithms
This page was built for publication: Quadratic Goldreich-Levin Theorems