On the Computational Complexity of Compressed Power Series

被引：0

作者：

Karatsuba, E. A. ^{[1
]}

机构：

[1] Russian Acad Sci, Fed Res Ctr Comp Sci & Control, Moscow 119333, Russia

来源：

MATHEMATICAL NOTES | 2023年 / 114卷 / 1-2期

基金：

俄罗斯科学基金会;

关键词：

algorithm; power series; computational complexity; fast algorithm; FEE method; Faulhaber's formula; Bernoulli numbers; MULTIPLICATION;

D O I：

10.1134/S000143462307009X

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We present computational algorithms and complexity estimates for power series in which all exponents are positive integers raised to one and the same integer power >= 2.

引用

页码：92 / 98

页数：7