138 citations · 509 across the 16 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.AG2013★ 3 cited
On the degree of the polynomial defining a planar algebraic curves of constant width
Magali Bardet, Térence Bayen
In this paper, we consider a family of closed planar algebraic curves which are given in parametrization form via a trigonometric polynomial . When i…
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…