On the public citation graph

Quadratic Goldreich--Levin Theorems

0 signed · 41 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01212974openalex-snapshot
A statistical theorem of set addition
inferredcites →https://doi.org/10.1007/s00039-010-0051-1openalex-snapshot
An Inverse Theorem for the Uniformity Seminorms Associated with the Action of $${{\mathbb {F}^{\infty}_{p}}}$$
inferredcites →https://doi.org/10.1007/s00039-010-0106-3openalex-snapshot
Linear Forms and Higher-Degree Uniformity for Functions On $${\mathbb{F}^{n}_{p}}$$
inferredcites →https://doi.org/10.1007/s00039-011-0141-8openalex-snapshot
Higher-Order Fourier Analysis Of $${\mathbb{F}_{p}^n}$$ And The Complexity Of Systems Of Linear Forms
inferredcites →https://doi.org/10.1007/s000390050065openalex-snapshot
A New Proof of Szemer�di's Theorem for Arithmetic Progressions of Length Four
inferredcites →https://doi.org/10.1007/s004930050052openalex-snapshot
Quick Approximation to Matrices and Applications
inferredcites →https://doi.org/10.1007/s11854-011-0026-7openalex-snapshot
Linear forms and quadratic uniformity for functions on ℤ N
inferredcites →https://doi.org/10.1017/s0013091505000325openalex-snapshot
AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
inferredcites →https://doi.org/10.1017/s096354831100037xopenalex-snapshot
Plünnecke's Inequality
inferredcites →https://doi.org/10.1090/crmp/043/06openalex-snapshot
Montréal notes on quadratic Fourier analysis
inferredcites →https://doi.org/10.1109/ccc.2007.15openalex-snapshot
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
inferredcites →https://doi.org/10.1109/ccc.2009.41openalex-snapshot
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution
inferredcites →https://doi.org/10.1109/focs.2010.71openalex-snapshot
A Fourier-Analytic Approach to Reed-Muller Decoding
inferredcites →https://doi.org/10.1109/focs.2011.59openalex-snapshot
Quadratic Goldreich--Levin Theorems
inferredcites →https://doi.org/10.1109/sfcs.2003.1238189openalex-snapshot
Proving hard-core predicates using list decoding
inferredcites →https://doi.org/10.1112/blms/bdp074openalex-snapshot
On the structure of steps of three-term arithmetic progressions in a dense set of integers
inferredcites →https://doi.org/10.1112/plms/pdp019openalex-snapshot
The true complexity of a system of linear equations
inferredcites →https://doi.org/10.1112/s0025579311001264openalex-snapshot
LINEAR FORMS AND QUADRATIC UNIFORMITY FOR FUNCTIONS ON
inferredcites →https://doi.org/10.1137/070712109openalex-snapshot
Pseudorandom Bits for Polynomials
inferredcites →https://doi.org/10.1145/1132516.1132519openalex-snapshot
Gowers uniformity, influence of variables, and PCPs
inferredcites →https://doi.org/10.1145/1250790.1250864openalex-snapshot
Low-degree tests at large distances
inferredcites →https://doi.org/10.1145/1374376.1374417openalex-snapshot
List-decoding reed-muller codes over small fields
inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
inferredcites →https://doi.org/10.1215/s0012-7094-04-12915-xopenalex-snapshot
On a question of Erdős and Moser
inferredcites →https://doi.org/10.2140/apde.2010.3.1openalex-snapshot
The inverse conjecture for the Gowers norm over finite fields via the correspondence principle
inferredcites →https://doi.org/10.2140/apde.2012.5.627openalex-snapshot
On the Bogolyubov–Ruzsa lemma
inferredcites →https://doi.org/10.4086/toc.gs.2011.003openalex-snapshot

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4614-6642-0_4openalex-snapshot
Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_79openalex-snapshot
Sampling-based proofs of almost-periodicity results and algorithmic applications
inferred← citeshttps://doi.org/10.1007/s00037-015-0100-0openalex-snapshot
Mining Circuit Lower Bound Proofs for Meta-Algorithms
inferred← citeshttps://doi.org/10.1007/s00208-026-03344-5openalex-snapshot
A Host–Kra $$\mathbb {F}_2^\omega $$-system of order 5 that is not Abramov of order 5, and non-measurability of the inverse theorem for the $$U^6(\mathbb {F}_2^n)$$ norm
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.11.003openalex-snapshot
Finite field models in arithmetic combinatorics – ten years on
inferred← citeshttps://doi.org/10.1017/9781108332699.010openalex-snapshot
Some applications of relative entropy in additive combinatorics
inferred← citeshttps://doi.org/10.1109/ccc.2014.34openalex-snapshot
Mining Circuit Lower Bound Proofs for Meta-algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611975031.43openalex-snapshot
Approximate Local Decoding of Cubic Reed-Muller Codes Beyond the List Decoding Radius
inferred← citeshttps://doi.org/10.1145/2556663.2556678openalex-snapshot
Guest column
inferred← citeshttps://doi.org/10.1145/3016802openalex-snapshot
Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs
inferred← citeshttps://doi.org/10.1145/3564246.3585224openalex-snapshot
A High Dimensional Goldreich-Levin Theorem
inferred← citeshttps://doi.org/10.1145/3717823.3718277openalex-snapshot
Polynomial-Time Tolerant Testing Stabilizer States
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9020openalex-snapshot
On Boosting Sparse Parities
showing the first 13 of 14 · page through all 14
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.