48 citations · 62 across the 14 of their papers we have counts for
Showing 2021 · cs.SCShow all
3 papers · 2 filters
cs.SC2021
Polynomial-Division-Based Algorithms for Computing Linear Recurrence Relations
Jérémy Berthomieu, Jean-Charles Faugère
Sparse polynomial interpolation, sparse linear system solving or modular rational reconstruction are fundamental problems in Computer Algebra. They come down to computing linear re…
cs.SC2021★ 48 cited
msolve: A Library for Solving Polynomial Systems
Jérémy Berthomieu, Christian Eder, Mohab Safey El Din
We present a new open source C library \texttt{msolve} dedicated to solving multivariate polynomial systems of dimension zero through computer algebra methods. The core algorithmic…
cs.SC2021
On the computation of asymptotic critical values of polynomial maps and applications
Jérémy Berthomieu, Andrew Ferguson, Mohab Safey El Din
Let be a polynomial tuple in and let . We consider the problem of comput…