Faster relaxed multiplication


In previous work, we have introduced several fast algorithms for relaxed power series multiplication (also known under the name on-line multiplication) up to a given order <i>n</i>. The fastest currently known algorithm works over an effective base field K with sufficiently many 2<sup><i>p</i></sup>-th roots of unity and has algebraic time complexity O(<i>n… (More)
DOI: 10.1145/2608628.2608657