内容简介：(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.
以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持 码农网
猜你喜欢:
本站部分资源来源于网络，本站转载出于传递更多信息之目的，版权归原作者或者来源机构所有，如转载稿涉及版权问题，请联系我们。
科学的极致：漫谈人工智能
集智俱乐部 / 人民邮电出版社 / 2015-7 / 49.00元
集智俱乐部是一个从事学术研究、享受科学乐趣的探索者组成的团体，倡导以平等开放的态度、科学实证的精神进行跨学科的研究与交流，力图搭建一个中国的“没有围墙的研究所”。这些令人崇敬的、充满激情与梦想的集智俱乐部成员将带你了解图灵机模型、冯•诺依曼计算机体系结构、怪圈与哥德尔定理、通用人工智能、深度学习、人类计算与自然语言处理，与你一起展开一场令人热血沸腾的科学之旅。一起来看看 《科学的极致：漫谈人工智能》 这本书的介绍吧!
