On computing a set of points meeting every cell defined by a family of polynomials on a variety

Journal of Complexity

Volumn 13, Issue 1, 1997, Pages 28-37

  Basu, Saugata ^a   Pollack, Richard ^a   Roy, Marie Françoise ^b  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITÉ DE RENNES 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031094481     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1997.0434     Document Type: Article

References (10)

1. S. Basu, R. Pollack, M.-F. Roy, A new algorithm to find a point in every cell defined by a family of polynomials, Quantifier Elimination and Cylindrical Algebraic Decomposition, Springer-Verlag, New York/Berlin.
2. Basu S., Pollack R., Roy M.-F. On the number of cells defined by a family of polynomials on a variety. Goldberg K. Y., Halperin D., Latombe J.-C., Wilson R. H. Algorithmic Foundations of Robotics. 1995;537-555 Peters, Boston.
3. S. Basu, R. Pollack, M.-F. Roy, On the combinatorial and algebraic complexity of quantifier elimination (extended abstract), Proc. 35th IEEE Symposium on Foundations of Computer Science, 1994, 632, 642, Association for Computing Machinery.
4. Basu S., Pollack R., Roy M.-F. On the number of cells defined by a family of polynomials on a variety. Mathematika. 43:1996;120-126.
5. Ben-Or M., Kozen D., Reif J. The complexity of elementary algebra and geometry. J. Comput. System Sci. 32:1986;251-264.
6. Bochnak J., Coste M., Roy M.-F. Géométrie algébrique réelle. 1987;Springer-Verlag, New York/Berlin.
7. Coste M., Roy M.-F. Thom's lemma, the coding of real algebraic numbers and the topology of semi-algebraic sets. J. Symbolic Comput. 5:1988;121-129.
8. Renegar J. On the computational complexity and geometry of the first order theory of the reals. J. Symbolic Comput. 1992.
9. M.-F. Roy, N. Vorobjov, Computing the complexification of a semialgebraic set, ISSAC 96.
10. Walker, 1950, Algebraic Curves, Princeton Univ. Press, Princeton, NJ.