Publication:3191612
From MaRDI portal
DOI10.4086/toc.2014.v010a001zbMath1366.68096MaRDI QIDQ3191612
Prahladh Harsha, Raghu Meka, Adam R. Klivans
Publication date: 6 October 2014
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2014.v010a001
68Q32: Computational learning theory
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
The correct exponent for the Gotsman-Linial conjecture, The Gaussian surface area and noise sensitivity of degree-\(d\) polynomial threshold functions, Upper Bounds on Fourier Entropy
Cites Work