Faster computation of Bernoulli numbers

DOI10.1016/0196-6774(92)90048-HzbMath0755.11006OpenAlexW2029949308MaRDI QIDQ4020356

Sandra Fillebrown

Publication date: 16 January 1993

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(92)90048-h

zbMATH Keywords

algorithmBernoulli numbers

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Bernoulli and Euler numbers and polynomials (11B68) Number-theoretic algorithms; complexity (11Y16)

Related Items (7)

An alternative to the Euler-Maclaurin summation formula: approximating sums by integrals only ⋮ A multimodular algorithm for computing Bernoulli numbers ⋮ Computer verification of the Ankeny--Artin--Chowla Conjecture for all primes less than $100000000000$ ⋮ Computing Hypergeometric Functions Rigorously ⋮ First-hit analysis of algorithms for computing quadratic irregularity ⋮ Learning Poisson binomial distributions ⋮ The complexity of number-theoretic constants

This page was built for publication: Faster computation of Bernoulli numbers