-
Sharper Complexity Bounds for Zero-dimensional Gröbner Bases and Polynomial S...
In this paper, we improve the bound of complexity of the algorithms on polynomial ideals having complexities polynomial in $d^n$ where $d$ is the maximal degree of... -
Contributions to relaxed algorithms and polynomial system solving
This PhD thesis is mostly devoted to the computation of p-adic lifting by relaxed algorithms. In a first part, we introduce relaxed algorithms and their application to... -
On the Complexity of Computing Gröbner Bases for Quasi-homogeneous Systems
International audience -
Rational Univariate Representations of Bivariate Systems and Applications
We address the problem of solving systems of two bivariate polynomials of total degree at most $d$ with integer coefficients of maximum bitsize $\tau$. It is known... -
Critical Point Methods and Effective Real Algebraic Geometry: New Results and...
International audience -
Separating linear forms for bivariate systems
We present an algorithm for computing a separating linear form of a system of bivariate polynomials with integer coefficients, that is a linear combination of the... -
Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
International audience -
Calcul formel : tendances et progrès récents
Article dans revue scientifique avec comité de lecture.
