A subquadratic algorithm for computing the n-th Bernoulli number

Math. Comp. 83 (2014), 2471–2477 (DOI).

arXiv preprint (September 2012).

Abstract

We describe a new algorithm that computes the n-th Bernoulli number in n4/3 + o(1) bit operations. This improves on previous algorithms that had complexity n2 + o(1).


Back to the main page