15 citations · 111 across the 23 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.SC2021★ 2 cited
On exact division and divisibility testing for sparse polynomials
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray
No polynomial-time algorithm is known to test whether a sparse polynomial G divides another sparse polynomial . While computing the quotient Q=F quo G can be done in polynomial…
cs.SC2021
Polynomial modular product verification and its implications
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray
Polynomial multiplication is known to have quasi-linear complexity in both the dense and the sparse cases. Yet no truly linear algorithm has been given in any case for the problem,…