{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T02:09:35Z","timestamp":1784081375518,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540160786","type":"print"},{"value":"9783540397588","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16078-7_69","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:38:03Z","timestamp":1330195083000},"page":"105-118","source":"Crossref","is-referenced-by-count":14,"title":["Polynomial time algorithms for finding integer relations among real numbers"],"prefix":"10.1007","author":[{"given":"J.","family":"Hastad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B.","family":"Helfrich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Lagarias","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C. P.","family":"Schnorr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"key":"9_CR1","unstructured":"G. Bergman (1980) Notes on Ferguson and Forcade's Generalized Euclidean Algorithm. Unpublished paper. University of California at Berkeley."},{"key":"9_CR2","unstructured":"A. Brentjes (1981) Multi-dimensional Continued Fraction Algorithms. Math. Centre Tracts No. 145. Universiteit Amsterdam."},{"issue":"6","key":"9_CR3","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1090\/S0273-0979-1979-14691-3","volume":"1","author":"H.R.P. Ferguson","year":"1979","unstructured":"H.R.P. Ferguson and R.W. Forcade (1979) Generalization of the euclidean algorithm for real numbers to all dimensions higher than two. Bulletin of the AMS 1,6 pp. 912\u2013914.","journal-title":"Bulletin of the AMS"},{"key":"9_CR4","unstructured":"H.R.P. Ferguson (1984) A non-inductive GL(n,\u2124) algorithm that constructs integral linear relations. Preprint. Brigham Young University"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"H.R.P. Ferguson (1985) A short proof of the existence of vector Euclidean algorithms to appear in Proceedings of the AMS.","DOI":"10.2307\/2046068"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1515\/crll.1868.69.29","volume":"69","author":"C.G.J. Jacobi","year":"1868","unstructured":"C.G.J. Jacobi (1868) Allgemeine Theorie der Kettenbruch\u00e4hnlichen Algorithmen. J. reine Angew. Math. 69 (1969), 29\u201364.","journal-title":"J. reine Angew. Math."},{"key":"9_CR7","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"21","author":"A.K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra Jr., and L. Love (1982) Factoring polynomials with rational coefficients. Math. Ann. 21, 515\u2013534.","journal-title":"Math. Ann."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"R. Kannan, A.K. Lenstra, and L. Lov\u00e0sz (1984) Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers. Proc. 16th Ann. ACM Symp. on Theory of Computing, pp. 191\u2013200.","DOI":"10.1145\/800057.808681"}],"container-title":["Lecture Notes in Computer Science","STACS 86"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16078-7_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T12:27:25Z","timestamp":1713616045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16078-7_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540160786","9783540397588"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-16078-7_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986]]}}}