scientific article; zbMATH DE number 3440002
From MaRDI portal
Publication:4766043
zbMath0279.68041MaRDI QIDQ4766043
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Continued fractions and generalizations (11J70) Radix representation; digital problems (11A63) Algorithms in computer science (68W99)
Related Items (11)
Computational schemes for subresultant chains ⋮ 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 ⋮ Parallelization of triangular decompositions: techniques and implementation ⋮ A fast version of the Schur-Cohn algorithm. ⋮ On the complexity of the Lickteig-Roy subresultant algorithm ⋮ Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation ⋮ On Schönhage's algorithm and subquadratic integer gcd computation ⋮ Fast computation of approximant bases in canonical form ⋮ Two efficient algorithms for the computation of ideal sums in quadratic orders ⋮ Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
This page was built for publication:
