Polynomials that Sign Represent Parity and Descartes’ Rule of Signs
暂无分享,去创建一个
[1] Roman Smolensky,et al. Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.
[2] Richard Beigel,et al. The polynomial method in circuit complexity , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[3] Akira Maruoka,et al. On the Complexity of Depth-2 Circuits with Threshold Gates , 2005, MFCS.
[4] E. T. Bell. Review: G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers , 1939 .
[5] Parikshit Gopalan. Constructing Ramsey graphs from Boolean function representations , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[6] Ryan O'Donnell,et al. Extremal properties of polynomial threshold functions , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[7] Mikael Goldmann,et al. On the Power of a Threshold Gate at the Top , 1997, Inf. Process. Lett..
[8] A. Razborov. Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .
[9] Adam R. Klivans. Learning Dnf in Time ¾ Ç´ò ½¿ Μ , 2001 .
[10] G. Hardy,et al. An Introduction to the Theory of Numbers , 1938 .
[11] Ryan O'Donnell,et al. New degree bounds for polynomial threshold functions , 2003, STOC '03.
[12] David A. Mix Barrington,et al. Representing Boolean functions as polynomials modulo composite numbers , 1994, computational complexity.
[13] Rocco A. Servedio,et al. Toward Attribute Efficient Learning of Decision Lists and Parities , 2006, J. Mach. Learn. Res..
[14] Vince Grolmusz,et al. Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs , 2000, Comb..
[15] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[16] G. Pólya,et al. Problems and theorems in analysis , 1983 .
[17] Richard Beigel,et al. Perceptrons, PP, and the polynomial hierarchy , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.
[18] Marvin Minsky,et al. Perceptrons: An Introduction to Computational Geometry , 1969 .
[19] Rocco A. Servedio,et al. Learning DNF in time , 2001, STOC '01.
[20] M. Saks. Slicing the hypercube , 1993 .
[21] Adam R. Klivans,et al. Learning DNF in time 2 Õ(n 1/3 ) . , 2001, STOC 2001.
[22] Adam R. Klivans. On the Derandomization of Constant Depth Circuits , 2001, RANDOM-APPROX.
[23] Ryan O'Donnell,et al. Learning juntas , 2003, STOC '03.
[24] Jeffrey C. Lagarias,et al. Multivariate descartes rule of signs and sturmfels’s challenge problem , 1997 .
[25] Vince Grolmusz,et al. Constructing set systems with prescribed intersection sizes , 2002, J. Algorithms.
[26] James Aspnes,et al. The expressive power of voting polynomials , 1994, Comb..
[27] Umesh V. Vazirani,et al. An Introduction to Computational Learning Theory , 1994 .
[28] Daniel A. Spielman,et al. The perceptron strikes back , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[29] Saugata Basu,et al. On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets , 1996, STOC '96.
[30] J. Maurice Rojas,et al. Counting Real Connected Components of Trinomial Curve Intersections and m-nomial Hypersurfaces , 2003, Discret. Comput. Geom..
[31] Daniel A. Spielman,et al. PP is closed under intersection , 1991, STOC '91.
[32] Rocco A. Servedio,et al. Learning intersections and thresholds of halfspaces , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[33] Pavel Pudlák,et al. On computing Boolean functions by sparse real polynomials , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[34] B. Sturmfels. Polynomial Equations and Convex Polytopes , 1998 .
[35] S. Basu,et al. Algorithms in real algebraic geometry , 2003 .