Schnelle Berechnung von Kettenbruchentwicklungen

1971/01/01 by A. Sch�nhage · 10 citations
Computer Science · Mathematics · #Mathematics and Applications #Matrix Theory and Algorithms #Polynomial and algebraic computation

paper · doi:10.1007/bf00289520

crossref issued 1971/01/01 · crossref published 1971/01/01 · crossref published-print 1971/01/01 · openalex publication_date 1971/01/01 · crossref created 2004/10/05 · openalex created_date 2016/06/24 · crossref deposited 2019/04/08 · crossref indexed 2026/04/22 · openalex updated_date 2026/07/23

Cited by

• On Schönhage’s algorithm and subquadratic integer gcd computation
• An O(M(n) logn) Algorithm for the Jacobi Symbol
• A New GCD Algorithm for Quadratic Number Rings with Unique Factorization
• (1 +i) - ary GCD Computation inZ[ i ]as an Analogue to the Binary GCD Algorithm
• Binary GCD Like Algorithms for Some Complex Quadratic Rings
• A Binary Recursive Gcd Algorithm
• Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers
• Neverending Fractions
• Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation
• Euclidean algorithm [wikipedia]