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]

Abstract

Abstract is missing.