scientific article
From MaRDI portal
Publication:3191611
DOI10.4086/toc.2014.v010a002zbMath1366.68089OpenAlexW2402751180MaRDI QIDQ3191611
Li-Yang Tan, Andrew Wan, Ilias Diakonikolas, Rocco A. Servedio
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.v010a002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting ⋮ Nonlocal Games with Noisy Maximally Entangled States are Decidable ⋮ Anti-concentration Inequalities for Polynomials ⋮ The correct exponent for the Gotsman-Linial conjecture ⋮ Concentration and Moment Inequalities for Polynomials of Independent Random Variables ⋮ Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors
Cites Work