{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,29]],"date-time":"2026-10-29T10:01:48Z","timestamp":1793268108642,"version":"4.5.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Ann."],"published-print":{"date-parts":[[1982,12]]},"DOI":"10.1007\/bf01457454","type":"journal-article","created":{"date-parts":[[2005,4,13]],"date-time":"2005-04-13T10:08:00Z","timestamp":1113386880000},"page":"515-534","source":"Crossref","is-referenced-by-count":3117,"title":["Factoring polynomials with rational coefficients"],"prefix":"10.1007","volume":"261","author":[{"given":"A. K.","family":"Lenstra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"suffix":"Jr.","given":"H. W.","family":"Lenstra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L.","family":"Lov\u00e1sz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF01457454_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L.M., Odlyzko, A.M.: Irreducibility testing and factorization of polynomials, to appear. Extended abstract: Proc. 22nd Annual IEEE Symp. Found. Comp. Sci., pp. 409\u2013418 (1981)","DOI":"10.1109\/SFCS.1981.20"},{"key":"BF01457454_CR2","series-title":"Mathematical Centre Tracts","volume-title":"Multi-dimensional continued fraction algorithms","author":"A.J. Brentjes","year":"1981","unstructured":"Brentjes, A.J.: Multi-dimensional continued fraction algorithms. Mathematical Centre Tracts 145. Amsterdam: Mathematisch Centrum 1981"},{"key":"BF01457454_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-6774(81)90036-5","volume":"2","author":"D.G. Cantor","year":"1981","unstructured":"Cantor, D.G.: Irreducible polynomials with integral coefficients have succinct certificates. J. Algorithms2, 385\u2013392 (1981)","journal-title":"J. Algorithms"},{"key":"BF01457454_CR4","volume-title":"An introduction to the geometry of numbers","author":"J.W.S. Cassels","year":"1971","unstructured":"Cassels, J.W.S.: An introduction to the geometry of numbers. Berlin, Heidelberg, New York: Springer 1971"},{"key":"BF01457454_CR5","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":"Ferguson, H.R.P., Forcade, R.W.: Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two. Bull. Am. Math. Soc.1, 912\u2013914 (1979)","journal-title":"Bull. Am. Math. Soc."},{"key":"BF01457454_CR6","volume-title":"An introduction to the theory of numbers","author":"G.H. Hardy","year":"1979","unstructured":"Hardy, G.H., Wright, E.M.: An introduction to the theory of numbers. Oxford: Oxford University Press 1979"},{"key":"BF01457454_CR7","volume-title":"The art of computer programming, Vol. 2, Seminumerical algorithms","author":"D.E. Knuth","year":"1981","unstructured":"Knuth, D.E.: The art of computer programming, Vol. 2, Seminumerical algorithms. Reading: Addison-Wesley 1981"},{"key":"BF01457454_CR8","series-title":"Report IW 190\/81","volume-title":"Lattices and factorization of polynomials","author":"A.K. Lenstra","year":"1981","unstructured":"Lenstra, A.K.: Lattices and factorization of polynomials, Report IW 190\/81. Amsterdam: Mathematisch Centrum 1981"},{"key":"BF01457454_CR9","unstructured":"Lenstra, H.W., Jr.: Integer programming with a fixed number of variables. Math. Oper. Res. (to appear)"},{"key":"BF01457454_CR10","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1090\/S0025-5718-1974-0354624-3","volume":"28","author":"M. Mignotte","year":"1974","unstructured":"Mignotte, M.: An inequality about factors of polynomials. Math. Comp.28, 1153\u20131157 (1974)","journal-title":"Math. Comp."},{"key":"BF01457454_CR11","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/358527.358540","volume":"24","author":"P. Pritchard","year":"1981","unstructured":"Pritchard, P.: A sublinear additive sieve for finding prime numbers. Comm. ACM24, 18\u201323 (1981)","journal-title":"Comm. ACM"},{"key":"BF01457454_CR12","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","volume":"6","author":"J. Barkley Rosser","year":"1962","unstructured":"Barkley Rosser, J., Schoenfeld, L.: Approximate formulas for some functions of prime numbers. Ill. J. Math.6, 64\u201394 (1962)","journal-title":"Ill. J. Math."},{"key":"BF01457454_CR13","volume-title":"The Hensel lemma in algebraic manipulation","author":"D.Y.Y. Yun","year":"1974","unstructured":"Yun, D.Y.Y.: The Hensel lemma in algebraic manipulation. Cambridge: MIT 1974; reprint: New York: Garland 1980"},{"key":"BF01457454_CR14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0022-314X(69)90047-X","volume":"1","author":"H. Zassenhaus","year":"1969","unstructured":"Zassenhaus, H.: On Hensel factorization. I. J. Number. Theory1, 291\u2013311 (1969)","journal-title":"J. Number. Theory"},{"key":"BF01457454_CR15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1090\/S0025-5718-1978-0476692-4","volume":"32","author":"H. Zassenhaus","year":"1978","unstructured":"Zassenhaus, H.: A remark on the Hensel factorization method. Math. Comp.32, 287\u2013292 (1978)","journal-title":"Math. Comp."},{"key":"BF01457454_CR16","unstructured":"Zassenhaus, H.: A new polynomial factorization algorithm (unpublished manuscript, 1981)"}],"container-title":["Mathematische Annalen"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01457454.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01457454\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01457454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01457454.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T18:16:03Z","timestamp":1581963363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01457454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["BF01457454"],"URL":"https:\/\/doi.org\/10.1007\/bf01457454","relation":{},"ISSN":["0025-5831","1432-1807"],"issn-type":[{"value":"0025-5831","type":"print"},{"value":"1432-1807","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}