scientific article; zbMATH DE number 3440002
From MaRDI portal
Publication:4766043
zbMATH Open0279.68041MaRDI QIDQ4766043FDOQ4766043
Authors: Donald E. Knuth 
Publication date: 1971
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Radix representation; digital problems (11A63) Continued fractions and generalizations (11J70) Algorithms in computer science (68W99)
Cited In (11)
- Computational schemes for subresultant chains
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
- 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.
- Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction
- Two efficient algorithms for the computation of ideal sums in quadratic orders
- Computing the torsion points of a variety defined by lacunary polynomials
- On Schönhage's algorithm and subquadratic integer gcd computation
- Parallelization of triangular decompositions: techniques and implementation
- Fast computation of approximant bases in canonical form
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)
