On the computational complexity of compressed power series

DOI10.1134/s000143462307009xOpenAlexW4386135431MaRDI QIDQ6084936

Ekatharine A. Karatsuba

Publication date: 7 November 2023

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s000143462307009x

zbMATH Keywords

algorithmcomputational complexitypower seriesBernoulli numbersfast algorithmFEE methodFaulhaber's formula

Mathematics Subject Classification ID

Bernoulli and Euler numbers and polynomials (11B68) Number-theoretic algorithms; complexity (11Y16) Numerical integration (65D30) Formal power series rings (13F25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comments to my works, written by myself
• Fast evaluation of transcendental functions
• Fast evaluation of the Hurwitz zeta function and Dirichlet \(L\)-series
• Fast computation of the Riemann zeta-function \(\zeta (s)\) for integer values of the argument \(s\)
• Fast multiplication of large numbers
• Faster Integer Multiplication
• Fast Computation of Some Special Integrals of Mathematical Physics
• Transcendental Numbers. (AM-16)
• Fast computation of \(\zeta(3)\) and of some special integrals using the Ramanujan formula and polylogarithms

This page was built for publication: On the computational complexity of compressed power series