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]
@article{HoevenL13-0,
title = {On the bit-complexity of sparse polynomial and series multiplication},
author = {Joris van der Hoeven and Grégoire Lecerf},
year = {2013},
doi = {10.1016/j.jsc.2012.06.004},
url = {http://dx.doi.org/10.1016/j.jsc.2012.06.004},
researchr = {https://researchr.org/publication/HoevenL13-0},
cites = {0},
citedby = {0},
journal = {Journal of Symbolic Computation},
volume = {50},
pages = {227-254},
}