内容简介：(Submitted on 1 Dec 2019 (v1), last revised 14 Jan 2020 (this version, v5))
Title: A non-symmetric divide-and-conquer recursive formula for the convolution of polynomials and power series
Authors: Thomas Baruchel
(Submitted on 1 Dec 2019 (v1), last revised 14 Jan 2020 (this version, v5))
Abstract: Some changes in a recent convolution formula are performed here in order to clean it up by using more conventional notations and by making use of more referrenced and documented components (namely Sierpiński's polynomials, the Thue-Morse sequence, the binomial modulo~2 transform and its inverse). Several variants are published here, by reading afterwards summed coefficients in another order; the last formula is then turned back from a summation to a new divide-and-conquer recursive formula.
以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持 码农网
猜你喜欢:
本站部分资源来源于网络，本站转载出于传递更多信息之目的，版权归原作者或者来源机构所有，如转载稿涉及版权问题，请联系我们。
Algorithms on Strings, Trees and Sequences
Dan Gusfield / Cambridge University Press / 1997-5-28 / USD 99.99
String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular seq......一起来看看 《Algorithms on Strings, Trees and Sequences》 这本书的介绍吧!
