Publication:4766043
From MaRDI portal
zbMath0279.68041MaRDI QIDQ4766043
Publication date: 1971
68Q25: Analysis of algorithms and problem complexity
65G50: Roundoff error
11J70: Continued fractions and generalizations
11A63: Radix representation; digital problems
68W99: Algorithms in computer science
Related Items
On Schönhage's algorithm and subquadratic integer gcd computation, Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation, Computational schemes for subresultant chains, Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms, On the complexity of the Lickteig-Roy subresultant algorithm, A fast version of the Schur-Cohn algorithm., Fast computation of approximant bases in canonical form, Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction, Computing the torsion points of a variety defined by lacunary polynomials, Two efficient algorithms for the computation of ideal sums in quadratic orders