COMPUTING ROADMAPS OF SEMI-ALGEBRAIC SETS ON A VARIETY
暂无分享,去创建一个
[1] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[2] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .
[3] Robert Hardt,et al. Semi-Algebraic Local-Triviality in Semi-Algebraic Mappings , 1980 .
[4] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .
[5] E. Lehmann. The General Decision Problem , 1986 .
[6] Michel Coste,et al. Thom's Lemma, the Coding of Real Algebraic Numbers and the Computation of the Topology of Semi-Algebraic Sets , 1988, J. Symb. Comput..
[7] John Canny,et al. The complexity of robot motion planning , 1988 .
[8] C. Morawetz. The Courant Institute of Mathematical Sciences , 1988 .
[9] J. Renegar,et al. On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .
[10] Joos Heintz,et al. Single Exponential Path Finding in Semialgebraic Sets. Part 1: The Case of a Regular Bounded Hypersurface , 1990, AAECC.
[11] Jean-Claude Latombe,et al. Robot motion planning , 1970, The Kluwer international series in engineering and computer science.
[12] James Renegar,et al. On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination , 1992, J. Symb. Comput..
[13] Masahiro Shiota,et al. Nash triviality in families of Nash manifolds , 1992 .
[14] Marie-Françoise Roy,et al. Real algebraic geometry , 1992 .
[15] 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..
[16] John F. Canny,et al. Computing Roadmaps of General Semi-Algebraic Sets , 1991, Comput. J..
[17] N. N. Vorob’ev,et al. Finding connected components of a semialgebraic set in subexponential time , 1994 .
[18] Chandrajit L. Bajaj,et al. Algebraic geometry and its applications: collections of papers from Shreeram S. Abhyankar's 60th birthday Conference , 1994 .
[19] Marie-Françoise Roy,et al. On the combinatorial and algebraic complexity of Quanti erEliminationS , 1994 .
[20] Saugata Basu,et al. Computing roadmaps of semi-algebraic sets , 1996 .
[21] Marie-Françoise Roy,et al. Computing the complexification of a semi-algebraic set , 1996, ISSAC '96.
[22] Marie-Françoise Roy,et al. On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety , 1995, J. Complex..
[23] S. Basu,et al. Computing roadmaps of semi-algebraic sets on a variety (extended abstract) , 1997 .