A Small PRG for Polynomial Threshold Functions of Gaussians
From MaRDI portal
Publication:5494970
DOI10.1109/FOCS.2011.16zbMath1292.68112OpenAlexW2117294010MaRDI QIDQ5494970
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/focs.2011.16
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (5)
Fooling Polytopes ⋮ A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting ⋮ Pseudorandomness via the Discrete Fourier Transform ⋮ The correct exponent for the Gotsman-Linial conjecture ⋮ Simple and efficient pseudorandom generators from gaussian processes
This page was built for publication: A Small PRG for Polynomial Threshold Functions of Gaussians
