scientific article; zbMATH DE number 3440002

MaRDI QIDQ4766043zbMATH OpenFDO

Authors Donald E. Knuth

Publication date 1971

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Continued fractions and generalizations (11J70) Roundoff error (65G50) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(15)

• 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
• Parallelization of triangular decompositions: techniques and implementation
• 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
• Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
• On Schönhage's algorithm and subquadratic integer gcd computation
• Linear average-case complexity of algorithmic problems in groups
• Orbit-blocking words and the average-case complexity of Whitehead's problem in the free group of rank 2
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Computational schemes for subresultant chains

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4766043)