93 citations · 692 across the 41 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.SC2013★ 19 cited
On the Complexity of the F5 Gröbner basis Algorithm
Magali Bardet, Jean-Charles Faugère, Bruno Salvy
We study the complexity of Gröbner bases computation, in particular in the generic situation where the variables are in simultaneous Noether position with respect to the system. We…
cs.SC2013★ 51 cited
Creative telescoping for rational functions using the Griffiths-Dwork method
Alin Bostan, Pierre Lairez, Bruno Salvy
Creative telescoping algorithms compute linear differential equations satisfied by multiple integrals with parameters. We describe a precise and elementary algorithmic version of t…