Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers

DOI10.1137/130947799zbMath1290.11106WikidataQ56958732 ScholiaQ56958732MaRDI QIDQ5419038

Bettina Just, Jeffrey C. Lagarias, Claus Peter Schnorr, Johan T. Håstad

Publication date: 4 June 2014

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/130947799

zbMATH Keywords

Diophantine approximation; lattice basis reduction; integer relations; multidimensional continued fraction algorithm; generalized Euclidean algorithms

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

11Y16: Number-theoretic algorithms; complexity

11H06: Lattices and convex bodies (number-theoretic aspects)

11J70: Continued fractions and generalizations

11Y65: Continued fraction calculations (number-theoretic aspects)

11H55: Quadratic forms (reduction theory, extreme forms, etc.)