48 citations · 62 across the 14 of their papers we have counts for
Showing 2022 · cs.SCShow all
2 papers · 2 filters
cs.SC2022★ 2 cited
New efficient algorithms for computing Gröbner bases of saturation ideals (F4SAT) and colon ideals (Sparse-FGLM-colon)
Jérémy Berthomieu, Christian Eder, Mohab Safey El Din
This paper is concerned with linear algebra based methods for solving exactly polynomial systems through so-called Gröbner bases, which allow one to compute modulo the polynomial i…
cs.SC2022★ 1 cited
Faster change of order algorithm for Gröbner bases under shape and stability assumptions
Jérémy Berthomieu, Vincent Neiger, Mohab Safey El Din
Solving zero-dimensional polynomial systems using Gröbner bases is usually done by, first, computing a Gröbner basis for the degree reverse lexicographic order, and next computing…