Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers
Publication:5419038
DOI10.1137/130947799zbMath1290.11106OpenAlexW2619102718WikidataQ56958732 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
Diophantine approximationlattice basis reductioninteger relationsmultidimensional continued fraction algorithmgeneralized Euclidean algorithms
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06) Continued fractions and generalizations (11J70) Continued fraction calculations (number-theoretic aspects) (11Y65) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)
This page was built for publication: Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers