A subquadratic algorithm for computing the n-th Bernoulli number
arXiv:1209.05336 citationsh-index: 21
Originality Incremental advance
AI Analysis
Provides a faster algorithm for computing Bernoulli numbers, which are important in number theory and combinatorics.
The paper presents a new algorithm for computing the n-th Bernoulli number with complexity n^(4/3 + o(1)) bit operations, improving over the previous n^(2 + o(1)).
We describe a new algorithm that computes the n-th Bernoulli number in n^(4/3 + o(1)) bit operations. This improves on previous algorithms that had complexity n^(2 + o(1)).