Real Advantage
From MaRDI portal
Publication:2947588
DOI10.1145/2540089zbMath1322.68076MaRDI 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
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Anti-concentration Inequalities for Polynomials, On polynomial approximations to AC, Combinatorial anti-concentration inequalities, with applications, Anticoncentration for subgraph statistics, An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs, Anticoncentration and Berry-Esseen bounds for random tensors, Geometric and o-minimal Littlewood-Offord problems, Anti-concentration of polynomials: dimension-free covariance bounds and decay of Fourier coefficients, Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration