Computational real algebraic geometry studies various algorithmic questions dealing with the real solutions of a system of equalities, inequalities, and inequations of polynomials over the real numbers. This emerging field is largely motivated by
|
1609
|
Robot Motion Planning
– Latombe
- 1991
|
|
424
|
The Complexity of Robot Motion Planning
– Canny
- 1988
|
|
352
|
A decision method for elementary algebra and geometry
– Tarski
- 1951
|
|
245
|
Quantifier elimination for real closed fields by cylindrical algebraic decomposition
– Collins
- 1975
|
|
157
|
On the combinatorial and algebraic complexity of Quantifier Elimination
– Basu, Pollack, et al.
- 1994
|
|
136
|
On the computational complexity and geometry of the first-order theory of the reals
– Renegar
- 1989
|
|
124
|
JOAN-ARINYO R.: Parametric modeling
– HOFFMANN
|
|
116
|
Géométrie Algébrique Réelle
– Bochnak, Coste, et al.
- 1987
|
|
109
|
The complexity of elementary algebra and geometry
– Ben-Or, Kozen, et al.
- 1984
|
|
81
|
Some algebraic and geometric computations in PSPACE
– Canny
- 1988
|
|
76
|
Algorithmic Algebra
– Mishra
- 1993
|
|
64
|
Mechanical Geometry Theorem Proving
– Chou
- 1988
|
|
52
|
Solving systems of polynomial inequalities in subexponential time
– Grigor’ev, Vorobjov
- 1988
|
|
42
|
Quantifier Elimination and Cylindrical Algebraic Decomposition
– Caviness, Johnson
- 1998
|
|
39
|
quantifier elimination is doubly exponential
– Davenport, Heintz, et al.
- 1988
|
|
32
|
The Complexity of deciding Tarski algebra
– GRIGOR'EV
- 1988
|
|
31
|
Improved algorithms for sign determination and existential quantifier elimination
– Canny
- 1993
|
|
28
|
Solernó: On the complexity of semialgebraic sets
– Heintz, Roy, et al.
- 1989
|
|
27
|
Algorithms in Real Algebraic Geometry and Applications to Computational Geometry
– Heintz, Reico, et al.
- 1991
|
|
26
|
Vorobjov Counting connected components of a semi-algebraic set in subexponential time
– Grigor'ev, N
- 1992
|
|
23
|
On the `Piano Movers
– Schwartz, Sharir
- 1983
|
|
22
|
A new algorithm to find a point in every cell defined by a family of polynomials
– Basu, Pollack, et al.
- 1998
|
|
19
|
On the number of cells defined by a set of polynomials
– POLLACK, ROY
- 1993
|
|
18
|
On the Betti numbers of real algebraic varieties
– Milnor
- 1964
|
|
17
|
Computational geometry: a retrospective
– Chazelle
- 1994
|
|
12
|
Recent progress on the complexity of the decision problem for the reals
– RENEGAR
- 1991
|
|
7
|
Real Algebraic and Semi-Algebraic Sets. Hermann, editeurs des sciences et des arts
– Benedetti, Risler
- 1990
|
|
6
|
Bibliography on algorithms in real algebra geometry
– Arnon
- 1988
|
|
3
|
Sur la complexite du principe de
– Heintz, Roy, et al.
- 1990
|
|
3
|
Sur l'Homologie des Vari'et'es R'eelles. Differential and Combinatorial Topology
– Thom
- 1965
|
|
