Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
Partial Cylindrical Algebraic Decomposition for quantifier elimination
Journal of Symbolic Computation
On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
Applying quantifier elimination to the Birkhoff interpolation problem
Journal of Symbolic Computation
Polar varieties, real equation solving, and data structures: the hypersurface case
Journal of Complexity
Modern computer algebra
Computing triangular systems and regular systems
Journal of Symbolic Computation
A Gröbner free alternative for polynomial system solving
Journal of Complexity
Algebraic and Semialgebraic Proofs: Methods and Paradoxes
ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
Hi-index | 0.00 |
Following the work of Gonzalez-Vega, this paper is devoted to showing how to use recent algorithmic tools of computational real algebraic geometry to solve the Birkhoff Interpolation Problem. We recall and partly improve two algorithms to find at least one point in each connected component of a real algebraic set defined by a single equation or a system of polynomial equations, both based on the computation of the critical points of a distance function. These algorithms are used to solve the Birkhoff Interpolation Problem in a case which was known as an open problem. The solution is available at the U.R.L.: http://www-calfor.lip6.fr/~safey/applications.html.