Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
type: Item
instance of: scholarly article
title: Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
zbMATH Open document ID: 0692.10033
DOI: 10.1137/0218059
author: Bettina Just
author: Jeffrey C. Lagarias
author: Johan Hastad
author: Claus Peter Schnorr
published in: SIAM Journal on Computing
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 11J70
Mathematics Subject Classification ID: 11H06
Mathematics Subject Classification ID: 11H55
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11Y65
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4132272
zbMATH Keywords: continued fraction
zbMATH Keywords: approximation algorithms
zbMATH Keywords: computational number theory
zbMATH Keywords: integer relation
zbMATH Keywords: multidimensional Euclidean algorithm
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1137/0218059
OpenAlex ID: W2027157239
Wikidata QID: Q56959232
Recommended article: Q3745271
Recommended article: Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers
Recommended article: Polynomial time over the reals with parsimony
Recommended article: Q3602570
Recommended article: Applications of integer relation algorithms
Recommended article: Integer complexity: algorithms and computational results
Recommended article: On the algorithmic complexity of some numeration-related problems
Recommended article: Polynomial time operations in explicit mathematics
Recommended article: Complexity of computation on real algebraic numbers
Recommended article: A fast algorithm for computing multiplicative relations between the roots of a generic polynomial
description: scientific article