93 citations · 387 across the 28 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
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…
math.AC2021
Koszul-type determinantal formulas for families of mixed multilinear systems
Matías R. Bender, Jean-Charles Faugère, Angelos Mantzaflaris +1
Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of ma…