A subquadratic algorithm for computing the ๐-th Bernoulli number
David Harvey ยท Mathematics of Computation ยท 2014
We describe a new algorithm that computes the n n th Bernoulli number in n 4 / 3 + o ( 1 ) n^{4/3 + o(1)} bit operations. This improves on previous algorithms that had complexity n 2 + o ( 1 ) n^{2 + o(1)} .