Making polynomials robust to noise

DOI10.1145/2213977.2214044zbMath1286.68145OpenAlexW2059242764MaRDI QIDQ5415513

Alexander A. Sherstov

Publication date: 13 May 2014

Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

zbMATH Keywords

polynomial approximationcomputation with noisereal polynomials on the boolean hypercube

Mathematics Subject Classification ID

Related Items (5)

Approximate Degree in Classical and Quantum Computing ⋮ Entanglement subvolume law for 2D frustration-free spin systems ⋮ Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research) ⋮ Unnamed Item ⋮ Dual lower bounds for approximate degree and Markov-Bernstein inequalities

This page was built for publication: Making polynomials robust to noise