|
On the Computational Complexity of Compressed Power Series
E. A. Karatsuba Dorodnitsyn Computing Centre of the Russian Academy of Sciences, Moscow
Abstract:
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 $\ge2$.
Keywords:
algorithm, power series, computational complexity, fast
algorithm, FEE method, Faulhaber's formula, Bernoulli numbers.
Received: 01.08.2022 Revised: 28.01.2023
Published: 07.07.2023
Citation:
E. A. Karatsuba, “On the Computational Complexity of Compressed Power Series”, Mat. Zametki, 114:1 (2023), 113–120; Math. Notes, 114:1 (2023), 92–98
Linking options:
https://www.mathnet.ru/eng/mzm13966https://doi.org/10.4213/mzm13966 https://www.mathnet.ru/eng/mzm/v114/i1/p113
|
|