On the number of zero-patterns of a sequence of polynomials
暂无分享,去创建一个
[1] P. Erdös. Some remarks on the theory of graphs , 1947 .
[2] R. C. Bose. A Note on Fisher's Inequality for Balanced Incomplete Block Designs , 1949 .
[3] D. Gale. A theorem on flows in networks , 1957 .
[4] H. Ryser. Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.
[5] J. Milnor. On the Betti numbers of real varieties , 1964 .
[6] R. Thom. Sur L'Homologie des Varietes Algebriques Réelles , 1965 .
[7] H. Warren. Lower bounds for approximation by nonlinear manifolds , 1968 .
[8] H. Montgomery. Topics in Multiplicative Number Theory , 1971 .
[9] N. Sauer,et al. On the factorization of the complete graph , 1973 .
[10] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .
[11] Richard M. Wilson,et al. On $t$-designs , 1975 .
[12] József Beck,et al. "Integer-making" theorems , 1981, Discret. Appl. Math..
[13] Peter Frankl,et al. Intersection theorems with geometric consequences , 1981, Comb..
[14] Joos Heintz,et al. Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields , 1983, Theor. Comput. Sci..
[15] W. Brownawell. Bounds for the degrees in the Nullstellensatz , 1987 .
[16] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .
[17] Par Patrice Philippon,et al. A propos du texte de W. D. Brownawell: “Bounds for the degrees in the Nullstellensatz” , 1988 .
[18] P. Frankl,et al. Linear Algebra Methods in Combinatorics I , 1988 .
[19] J. Kollár. Sharp effective Nullstellensatz , 1988 .
[20] S. Graham,et al. Lower Bounds for Least Quadratic Non-Residues , 1990 .
[21] Noga Alon. Ramsey graphs cannot be defined by real polynomials , 1990, J. Graph Theory.
[22] André Galligo,et al. Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields , 1990 .
[23] Robert E. Gompf,et al. On the topology of algebraic surfaces , 1991 .
[24] Noam Nisan,et al. Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..
[25] Vojtech Rödl,et al. A combinatorial approach to complexity , 1992, Comb..
[26] Richard M. Wilson,et al. A course in combinatorics , 1992 .
[27] Avi Wigderson,et al. On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[28] N. Alon,et al. Repeated communication and Ramsey graphs , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.
[29] S. Basu,et al. On the number of cells defined by a family of polynomials on a variety , 1996 .
[30] N. Alon. Tools from higher algebra , 1996 .
[31] Anna Gál. A characterization of span program size and improved lower bounds for monotone span programs , 1998, STOC '98.
[32] Miklós Ajtai,et al. A non-linear time lower bound for Boolean branching programs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[33] Avi Wigderson,et al. Superpolynomial Lower Bounds for Monotone Span Programs , 1996, Comb..
[34] Xu Shi. On two-distance sets in Euclidean Space , 2002 .