The expressive power of voting polynomials
暂无分享,去创建一个
James Aspnes | Richard Beigel | Steven Rudich | Merrick L. Furst | J. Aspnes | M. Furst | R. Beigel | S. Rudich
[1] Erich Stiemke. Über positive Lösungen homogener linearer Gleichungen , 1915 .
[2] Richard Beigel,et al. Relativized Counting Classes: Relations among Thresholds, Parity, and Mods , 1991, J. Comput. Syst. Sci..
[3] Jehoshua Bruck,et al. Harmonic Analysis of Polynomial Threshold Functions , 1990, SIAM J. Discret. Math..
[4] Roman Smolensky,et al. Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.
[5] Leslie G. Valiant,et al. NP is as easy as detecting unique solutions , 1985, STOC '85.
[6] John Gill,et al. Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..
[7] Marvin Minsky,et al. Perceptrons: expanded edition , 1988 .
[8] Jehoshua Bruck,et al. Polynomial threshold functions, AC functions and spectrum norms , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[9] Andrew Chi-Chih Yao,et al. Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.
[10] A. Razborov. Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .
[11] Jun Tarui. Randomized Polynomials, Threshold Circuits, and the Polynomial Hierarchy , 1991, STACS.
[12] Jean-Pierre Bourguignon,et al. Mathematische Annalen , 1893 .
[13] M. A. Epstein. Lower Bounds for the Size of Circuits of Bounded Depth in Basis F^; G , 1986 .
[14] Noam Nisan,et al. Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.
[15] Daniel A. Spielman,et al. The perceptron strikes back , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[16] Michael E. Saks,et al. On threshold circuits for parity , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.