2011 IEEE 26th Annual Conference on Computational Complexity (2011)
San Jose, California USA
June 8, 2011 to June 11, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCC.2011.13
We show that limited independence suffices to fool polynomial threshold functions of arbitrary degree.
Polynomials, Gaussian distributions, Threshold logic functions
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.