13 citations · 23 across the 6 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2013★ 1 cited
Efficient Algorithms for Computing Rational First Integrals and Darboux Polynomials of Planar Polynomial Vector Fields
Alin Bostan, Guillaume Chèze, Thomas Cluzeau +1
We present fast algorithms for computing rational first integrals with bounded degree of a planar polynomial vector field. Our approach is inspired by an idea of Ferragut and Giaco…
cs.SC2006★ 13 cited
Low Complexity Algorithms for Linear Recurrences
Alin Bostan, Frédéric Chyzak, Bruno Salvy +1
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; inde…