Real Advantage

DOI10.1145/2540089zbMath1322.68076OpenAlexW2294607147MaRDI QIDQ2947588

Emanuele Viola, Alexander A. Razborov

Publication date: 24 September 2015

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2540089

zbMATH Keywords

polynomialslower boundsparitycorrelation bounds

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (9)

Anti-concentration of polynomials: dimension-free covariance bounds and decay of Fourier coefficients ⋮ Anticoncentration and Berry-Esseen bounds for random tensors ⋮ Anti-concentration Inequalities for Polynomials ⋮ On polynomial approximations to AC ⋮ An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs ⋮ Combinatorial anti-concentration inequalities, with applications ⋮ Anticoncentration for subgraph statistics ⋮ Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration ⋮ Geometric and o-minimal Littlewood-Offord problems

This page was built for publication: Real Advantage