A subquadratic algorithm for computing the $n$-th Bernoulli number (Q3189433): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0533
@@ Property / arXiv ID: 1209.0533 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
+Normal rank
@@ Property / cites work @@
+Fast Computation of Bernoulli, Tangent and Secant Numbers
+Normal rank
@@ Property / cites work @@
+Number Theory
@@ Property / cites work: Number Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4769056
@@ Property / cites work: Q4769056 / rank @@
+Normal rank
@@ Property / cites work @@
+A multimodular algorithm for computing Bernoulli numbers
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4237366
@@ Property / cites work: Q4237366 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4406533
@@ Property / cites work: Q4406533 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Frobenius maps and factoring polynomials
+Normal rank
@@ Property / OpenAlex ID @@
+W2907934284
@@ Property / OpenAlex ID: W2907934284 / rank @@
+Normal rank