A subquadratic algorithm for computing the n-th Bernoulli number
Number Theory
2013-05-02 v3 Data Structures and Algorithms
Numerical Analysis
Abstract
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)).
Cite
@article{arxiv.1209.0533,
title = {A subquadratic algorithm for computing the n-th Bernoulli number},
author = {David Harvey},
journal= {arXiv preprint arXiv:1209.0533},
year = {2013}
}
Comments
few minor changes, to appear in Mathematics of Computation