Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
Publication:3033848
DOI10.1137/0218059zbMath0692.10033WikidataQ56959232 ScholiaQ56959232MaRDI QIDQ3033848
Jeffrey C. Lagarias, Johan T. Håstad, Bettina Just, Claus Peter Schnorr
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0218059
continued fraction; approximation algorithms; computational number theory; integer relation; multidimensional Euclidean algorithm
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.)
Related Items