The Community for Technology Leaders
2011 IEEE 26th Annual Conference on Computational Complexity (2011)
San Jose, California USA
June 8, 2011 to June 11, 2011
ISSN: 1093-0159
ISBN: 978-0-7695-4411-3
pp: 252-261
ABSTRACT
We show that limited independence suffices to fool polynomial threshold functions of arbitrary degree.
INDEX TERMS
Polynomials, Gaussian distributions, Threshold logic functions
CITATION

D. M. Kane, "k-Independent Gaussians Fool Polynomial Threshold Functions," 2011 IEEE 26th Annual Conference on Computational Complexity(CCC), San Jose, California USA, 2011, pp. 252-261.
doi:10.1109/CCC.2011.13
78 ms
(Ver 3.3 (11022016))