Elsevier

Journal of Symbolic Computation

Volume 5, Issues 1–2, February–April 1988, Pages 109-119
Journal of Symbolic Computation

Some aspects of complexity in real algebraic geometry

https://doi.org/10.1016/S0747-7171(88)80007-5Get rights and content
Under an Elsevier user license
open archive

This paper gives a description of some aspects of complexity in real algebraic geometry: explicit bounds for the topology of real algebraic and semi-algebraic sets are given in term of the degree of the equations and inequations (results by Milnor-Thom), and then in term of the additive complexity of the equations and inequations (i.e. in term of the minimal number of addition-substractions needed to evaluate the equations) (results by Grigorlev-Risler).

Those results are then used to give lower bounds for the complexity of various algorithms (results of Ben-Or).

The work of Collins and its school about C.A.D. of semi-algebraic sets is mentioned, and the paper ends with a description of a class of real analytic sets to which it is possible to generalise some of the previous methods (results by Hovansky).

Cited by (0)