Faster computation of Bernoulli numbers
From MaRDI portal
Recommendations
Cited in
(15)- The complexity of number-theoretic constants
- On accelerated methods to evaluate sums of products of rational numbers
- An alternative to the Euler-Maclaurin summation formula: approximating sums by integrals only
- Computing hypergeometric functions rigorously
- Fast computation of Bernoulli, tangent and secant numbers
- Acceleration of the computation of Bernoulli numbers
- A subquadratic algorithm for computing the n-th Bernoulli number
- A fast algorithm for computing the number of magic series
- A multimodular algorithm for computing Bernoulli numbers
- First-hit analysis of algorithms for computing quadratic irregularity
- Speedable Left-c.e. Numbers
- scientific article; zbMATH DE number 3851190 (Why is no real title available?)
- The DC algorithm for computing sums of powers of consecutive integers and Bernoulli numbers
- Algorithms for Bernoulli numbers and Euler numbers
- Computer verification of the Ankeny-Artin-Chowla Conjecture for all primes less than 100 000 000 000
This page was built for publication: Faster computation of Bernoulli numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4020356)