On the bit-complexity of sparse polynomial and series multiplication

Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02350494
Contributor : Joris van der Hoeven <>
Submitted on : Wednesday, November 6, 2019 - 8:46:26 AM
Last modification on : Thursday, November 7, 2019 - 1:30:50 AM

Links full text

Identifiers

Collections

Citation

Joris van der Hoeven, Grégoire Lecerf. On the bit-complexity of sparse polynomial and series multiplication. Journal of Symbolic Computation, Elsevier, 2013, 50, pp.227-254. ⟨10.1016/j.jsc.2012.06.004⟩. ⟨hal-02350494⟩

Share

Metrics

Record views

8