A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Joris van der Hoeven, Grégoire Lecerf. "On the bit-complexity of sparse polynomial and series multiplication." Journal of symbolic computation (2013) 227-254