On the combinatorial and algebraic complexity of quantifier elimination, Journal of the ACM, vol.43, issue.6, pp.1002-1045, 1996. ,
DOI : 10.1145/235809.235813
Algorithms in real algebraic geometry, Algorithms and Computation in Mathematics, vol.10, 2006. ,
DOI : 10.1007/978-3-662-05355-3
URL : https://hal.archives-ouvertes.fr/hal-01083587
Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, ISSAC '08, pp.79-86, 2008. ,
DOI : 10.1145/1390768.1390782
Global optimization of polynomials restricted to a smooth variety using sums of squares, Journal of Symbolic Computation, vol.47, issue.5, pp.503-518, 2012. ,
DOI : 10.1016/j.jsc.2011.12.003
URL : https://hal.archives-ouvertes.fr/hal-00744605
Deciding reachability of the infimum of a multivariate polynomial InÉ In´InÉ. Schost and I, Proceedings of the 36th international symposium on Symbolic and algebraic computation, pp.131-138, 2011. ,
An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for quantifier elimination, Proceedings of the 2009 conference on Symbolic numeric computation, pp.55-64, 2009. ,
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, ISSAC '08, pp.155-164, 2008. ,
DOI : 10.1145/1390768.1390792
Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients, Journal of Symbolic Computation, vol.47, issue.1, pp.1-15, 2012. ,
DOI : 10.1016/j.jsc.2011.08.002
Computing integral points in convex semi-algebraic sets, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.162-171, 1997. ,
DOI : 10.1109/SFCS.1997.646105
Integer Optimization on Convex Semialgebraic Sets, Discrete & Computational Geometry, vol.23, issue.2, pp.207-224, 2000. ,
DOI : 10.1007/PL00009496
An exact duality theory for semidefinite programming based on sums of squares. ArXiv e-prints, 2012. ,
Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.515-534, 1982. ,
DOI : 10.1007/BF01457454
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.318
Computing sum of squares decompositions with rational coefficients, Theoretical Computer Science, vol.409, issue.2, pp.269-281, 2008. ,
DOI : 10.1016/j.tcs.2008.09.025
An algorithm for sums of squares of real polynomials, Journal of Pure and Applied Algebra, vol.127, issue.1, pp.99-104, 1998. ,
DOI : 10.1016/S0022-4049(97)83827-3
Solving Zero-Dimensional Systems Through the Rational Univariate Representation, Applicable Algebra in Engineering, Communication and Computing, vol.9, issue.5, pp.433-461, 1999. ,
DOI : 10.1007/s002000050114
URL : https://hal.archives-ouvertes.fr/inria-00073264
RAGLib (Real Algebraic Geometry Library), Maple Package ,
Testing Sign Conditions on a Multivariate Polynomial and Applications, Mathematics in Computer Science, vol.1, issue.1, pp.177-207, 2007. ,
DOI : 10.1007/s11786-007-0003-9
URL : https://hal.archives-ouvertes.fr/inria-00105835
Computing the global optimum of a multivariate polynomial over the reals, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, ISSAC '08, pp.71-78, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-01305635
Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions, SIAM Journal on Optimization, vol.20, issue.6, pp.2876-2889, 2010. ,
DOI : 10.1137/090772459
URL : https://hal.archives-ouvertes.fr/inria-00419983
Descending the ground field in sums of squares representations, p.9, 2012. ,