93 citations · 387 across the 28 of their papers we have counts for
5 papers · 2 filters
On the Complexity of the F5 Gröbner basis Algorithm
Magali Bardet, Jean-Charles Faugère, Bruno Salvy
We study the complexity of Gröbner bases computation, in particular in the generic situation where the variables are in simultaneous Noether position with respect to the system. We…
Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case
Jérémy Berthomieu, Jean-Charles Faugère, Ludovic Perret
Let and be two sets of nonlinear polynomials over ( being a fie…
Sparse FGLM algorithms
Jean-Charles Faugère, Chenqi Mou
Given a zero-dimensional ideal I in K[x1,...,xn] of degree D, the transformation of the ordering of its Groebner basis from DRL to LEX is a key step in polynomial system solving an…
Polynomial Systems Solving by Fast Linear Algebra
Jean-Charles Faugère, Pierrick Gaudry, Louise Huot +1
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on…
On the Complexity of Computing Gröbner Bases for Quasi-homogeneous Systems
Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron
Let $\K$ be a field and $(f_1, \ldots, f_n)\subset \K[X_1, \ldots, X_n]$ be a sequence of quasi-homogeneous polynomials of respective weighted degrees w.r.t a…