AbstractA new algorithm is presented for solving algebraic systems of equations, which is designed from the structure which is wanted for the result. This algorithm is not yet implemented; thus technical details and proofs are omitted, for emphasizing on the relations between the algorithm design and a good representation of the result. The algorithm is based on a new theorem of decomposition for algebraic varieties
AbstractWe study the representation of the solutions of a polynomial system by triangular sets, and ...
AbstractWe give bit-size estimates for the coefficients appearing in triangular sets describing posi...
In this paper, we present some new results concerning the dimension of the irreducible components of...
AbstractA new algorithm is presented for solving algebraic systems of equations, which is designed f...
AbstractIt is shown that a good output for a solver of algebraic systems of dimension zero consists ...
The goal of this thesis is to analyze the solution sets of systems of polynomial equations and inequ...
AbstractIn this paper, we present new mathematical results and several new algorithm for solving a s...
Polynomial systems arise in many applications: robotics, kinematics, chemical kinetics, computer v...
Several algorithms are already known to compute the dimension of a projective algebraicvariety. But ...
Given a system of polynomial equations and inequations with coe- cients in the eld of rational numb...
AbstractGiven a system of polynomial equations and inequations with coefficients in the field of rat...
AbstractThis article proposes a new method for finding certain solutions of systems of algebraic equ...
International audienceThis paper presents an algorithm for decomposing any positive-dimensional poly...
Real algebraic geometry deals with the solution set of (possibly quantified) systems of polynomial e...
This paper presents a lecture on existing algorithms for solving poly-nomial systems with their comp...
AbstractWe study the representation of the solutions of a polynomial system by triangular sets, and ...
AbstractWe give bit-size estimates for the coefficients appearing in triangular sets describing posi...
In this paper, we present some new results concerning the dimension of the irreducible components of...
AbstractA new algorithm is presented for solving algebraic systems of equations, which is designed f...
AbstractIt is shown that a good output for a solver of algebraic systems of dimension zero consists ...
The goal of this thesis is to analyze the solution sets of systems of polynomial equations and inequ...
AbstractIn this paper, we present new mathematical results and several new algorithm for solving a s...
Polynomial systems arise in many applications: robotics, kinematics, chemical kinetics, computer v...
Several algorithms are already known to compute the dimension of a projective algebraicvariety. But ...
Given a system of polynomial equations and inequations with coe- cients in the eld of rational numb...
AbstractGiven a system of polynomial equations and inequations with coefficients in the field of rat...
AbstractThis article proposes a new method for finding certain solutions of systems of algebraic equ...
International audienceThis paper presents an algorithm for decomposing any positive-dimensional poly...
Real algebraic geometry deals with the solution set of (possibly quantified) systems of polynomial e...
This paper presents a lecture on existing algorithms for solving poly-nomial systems with their comp...
AbstractWe study the representation of the solutions of a polynomial system by triangular sets, and ...
AbstractWe give bit-size estimates for the coefficients appearing in triangular sets describing posi...
In this paper, we present some new results concerning the dimension of the irreducible components of...