On the bit-complexity of sparse polynomial and series multiplication

Joris van der Hoeven, Grégoire Lecerf. On the bit-complexity of sparse polynomial and series multiplication. Journal of Symbolic Computation, 50:227-254, 2013. [doi]

Authors

Joris van der Hoeven

This author has not been identified. Look up 'Joris van der Hoeven' in Google

Grégoire Lecerf

This author has not been identified. Look up 'Grégoire Lecerf' in Google