A subquadratic algorithm for computing the n-th Bernoulli number
classification
🧮 math.NT
cs.DScs.NAmath.NA
keywords
algorithmbernoullin-thnumberalgorithmscomplexitycomputescomputing
read the original 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)).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.