On the number of cells defined by a family of polynomials on a variety
暂无分享,去创建一个
[1] J. Milnor. On the Betti numbers of real varieties , 1964 .
[2] R. Thom. Sur L'Homologie des Varietes Algebriques Réelles , 1965 .
[3] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[4] M-F Roy,et al. Géométrie algébrique réelle , 1987 .
[5] J. Renegar,et al. On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .
[6] James Renegar,et al. On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals , 1992, J. Symb. Comput..
[7] R. Pollack,et al. On the number of cells defined by a set of polynomials , 1993 .
[8] John F. Canny. Improved Algorithms for Sign Determination and Existential Quantifier Elimination , 1993, Comput. J..
[9] John F. Canny,et al. Computing Roadmaps of General Semi-Algebraic Sets , 1991, Comput. J..
[10] Marie-Françoise Roy,et al. On the combinatorial and algebraic complexity of quantifier elimination , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[11] Rephael Wenger,et al. Bounding the number of geometric permutations induced by k-transversals , 1994, SCG '94.