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]
No references recorded for this publication.
No citations of this publication recorded.