Fooling Gaussian PTFs via local hyperconcentration

DOI10.1145/3357713.3384281MaRDI QIDQ5145002zbMATH OpenOpenAlexFDO

Authors Ryan O'Donnell, Li-Yang Tan, Rocco A. Servedio

Publication date 19 January 2021

Published in Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2103.07809

zbMATH Keywords

Gaussian spacepolynomial threshold functionspseudorandomness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(3)

• The computational advantage of MIP* vanishes in the presence of noise
• The computational advantage of MIP* vanishes in the presence of noise
• Improved parallel derandomization via finite automata with applications

This page was built for publication: Fooling Gaussian PTFs via local hyperconcentration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145002)