A subquadratic algorithm for computing the n-th Bernoulli number
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)).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.