The decidability of real algebraic sets by the index formula
|Published in||Coste, M., Mahé, L. & Roy, M.-F. Real algebraic geometry. Proceedings of the Conference held in Rennes, France, June 24–28, 1991: Springer. 1992, p. 235-239|
Lecture Notes in Mathematics; 1524
|Abstract||We propose an algorithm to decide if a real algebraic set defined by polynomials with integer coefficients has a non empty intersection with a given ball by the index formula of Kronecker. We approximate the integral by a Riemann sum and we give an estimate of the time of computation which is needed. The method is well adapted to the use of parallel time computations.|
|Keywords||Real algebraic geometry — Index formula — NP-problems|
This document has no fulltext available yet, but you can contact its author by using the form below.
|FRANÇOISE, J.-P., RONGA, Felice. The decidability of real algebraic sets by the index formula. In: Coste, M., Mahé, L. & Roy, M.-F. (Ed.). Real algebraic geometry. Proceedings of the Conference held in Rennes, France, June 24–28, 1991. [s.l.] : Springer, 1992. p. 235-239. (Lecture Notes in Mathematics; 1524) https://archive-ouverte.unige.ch/unige:12084|