论文信息 - A subquadratic algorithm for computing the n-th Bernoulli number

A subquadratic algorithm for computing the n-th Bernoulli number

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)).

David Harvey | David Harvey

[1] Joachim von zur Gathen,et al. Modern Computer Algebra , 1998 .

[2] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[3] Richard P. Brent,et al. Fast computation of Bernoulli, Tangent and Secant numbers , 2011, ArXiv.

[4] H. Cohen. Analytic and modern tools , 2007 .

[5] A. Meyers. Reading , 1999, Language Teaching.

[6] David Harvey,et al. A multimodular algorithm for computing Bernoulli numbers , 2008, Math. Comput..

[7] L. Comtet,et al. Advanced Combinatorics: The Art of Finite and Infinite Expansions , 1974 .

[8] Victor Shoup,et al. A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic , 1991, ISSAC '91.

[9] Joachim von zur Gathen,et al. Computing Frobenius maps and factoring polynomials , 2005, computational complexity.