Fast computation of continued fraction expansions.
From MaRDI portal
Publication:2548173
DOI10.1007/BF00289520zbMath0223.68008OpenAlexW1583935850WikidataQ56047914 ScholiaQ56047914MaRDI QIDQ2548173
Publication date: 1971
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289520
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07) Continued fraction calculations (number-theoretic aspects) (11Y65)
Related Items
An approximating \(k\)-ary GCD algorithm, Computational schemes for subresultant chains, On the number of divisions of the Euclidean algorithm applied to Gaussian integers, Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction, Computing minimal interpolation bases, Jebelean-Weber's algorithm without spurious factors, The shifted number system for fast linear algebra on integer matrices, On the complexity exponent of polynomial system solving, Complexity of computation in finite fields, Cauchy index computation, Parallelization of triangular decompositions: techniques and implementation, Finding a shortest vector in a two-dimensional lattice modulo m, Probabilistic analyses of the plain multiple gcd algorithm, An extended Jebelean^ WeberNSedjelmaci GCD algorithm, On the complexity of inverting integer and polynomial matrices, Analysis of Euclidean algorithms for polynomials over finite fields, A modular reduction for GCD computation., Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation, How can we solve a linear Diophantine equation by the basis reduction algorithm, Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers, A fast version of the Schur-Cohn algorithm., Symmetric subresultants and applications, \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.], On the complexity of the Lickteig-Roy subresultant algorithm, Sylvester-Habicht sequences and fast Cauchy index computation, Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation, Asymptotically fast polynomial matrix algorithms for multivariable systems, A Gröbner free alternative for polynomial system solving, Fast modular transforms, An O(M(n) logn) Algorithm for the Jacobi Symbol, On Schönhage's algorithm and subquadratic integer gcd computation, Integer programming with 2-variable equations and 1-variable inequalities, Fast multivariate multi-point evaluation revisited, A Rigorous Subexponential Algorithm For Computation of Class Groups, Fast computation of approximant bases in canonical form, The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\), Three new factors of Fermat numbers, Two efficient algorithms for the computation of ideal sums in quadratic orders, On the worst case of three algorithms for computing the Jacobi symbol, Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms, The Mixed Binary Euclid Algorithm, Some Related Functions to Integer GCD and Coprimality, Complexity questions in number theory, Analysis of algorithms on problems in general abelian groups, Short vectors of planar lattices via continued fractions, Fast computation of the biquadratic residue symbol., Quasi-gcd computations, Finding roots in with the successive resultants algorithm, Computing a basis for a finite Abelian p-group
Cites Work
