20 citations · 26 across the 4 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2016★ 1 cited
On the p-adic stability of the FGLM algorithm
Guénaël Renault, Tristan Vaccon
Nowadays, many strategies to solve polynomial systems use the computation of a Gr{ö}bner basis for the graded reverse lexicographical ordering, followed by a change of ordering alg…
cs.SC2013★ 20 cited
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…