{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T22:15:57Z","timestamp":1790460957781,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540128687","type":"print"},{"value":"9783540387565","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-12868-9_108","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:56:10Z","timestamp":1330174570000},"page":"245-254","source":"Crossref","is-referenced-by-count":26,"title":["Factoring polynomials over algebraic number fields"],"prefix":"10.1007","author":[{"given":"A. K.","family":"Lenstra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"E. R. Berlekamp","year":"1970","unstructured":"E.R. Berlekamp, Factoring polynomials over large finite fields, Math. Comp. 24 (1970), 713\u2013735.","journal-title":"Math. Comp."},{"key":"24_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/355791.355795","volume":"4","author":"W. S. Brown","year":"1978","unstructured":"W.S. Brown, The subresultant PRS algorithm, ACM Transactions on mathematical software 4 (1978), 237\u2013249.","journal-title":"ACM Transactions on mathematical software"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1137\/1016065","volume":"16","author":"A. J. Goldstein","year":"1974","unstructured":"A.J. Goldstein, R.L. Graham, A Hadamard-type bound on the coefficients of a determinant of polynomials, SIAM Rev. 16 (1974), 394\u2013395.","journal-title":"SIAM Rev."},{"key":"24_CR4","volume-title":"The art of computer programming, vol. 2, Seminumerical algorithms","author":"D. E. Knuth","year":"1981","unstructured":"D.E. Knuth, The art of computer programming, vol. 2, Seminumerical algorithms, Addison Wesley, Reading, second edition 1981.","edition":"second edition"},{"key":"24_CR5","unstructured":"S. Landau, Factoring polynomials over algebraic number fields is in polynomial-time, unpublished manuscript, 1982."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"A.K. Lenstra, Lattices and factorization of polynomials over algebraic number fields, Proceedings Eurocam 82, LNCS 144, 32\u201339.","DOI":"10.1007\/3-540-11607-9_4"},{"key":"24_CR7","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra, Jr., L. Lov\u00e1sz, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515\u2013534.","journal-title":"Math. Ann."},{"key":"24_CR8","volume-title":"Factoring polynomials over algebraic number fields, Report IW 213\/82","author":"A. K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, Factoring polynomials over algebraic number fields, Report IW 213\/82, Mathematisch Centrum, Amsterdam 1982."},{"key":"24_CR9","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1090\/S0025-5718-1974-0354624-3","volume":"28","author":"M. Mignotte","year":"1974","unstructured":"M. Mignotte, An inequality about factors of polynomials, Math. Comp. 28 (1974), 1153\u20131157.","journal-title":"Math. Comp."},{"key":"24_CR10","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/355705.355709","volume":"2","author":"P. J. Weinberger","year":"1976","unstructured":"P.J. Weinberger, L.P. Rothschild, Factoring polynomials over algebraic number fields, ACM Transactions on mathematical software 2 (1976), 335\u2013350.","journal-title":"ACM Transactions on mathematical software"},{"key":"24_CR11","volume-title":"The Hensel lemma in algebraic manipulation","author":"D. Y. Y. Y. Yun","year":"1974","unstructured":"D.Y.Y. Yun, The Hensel lemma in algebraic manipulation, MIT, Cambridge 1974; reprint: Garland Publ. Co., New York 1980."}],"container-title":["Lecture Notes in Computer Science","Computer Algebra"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12868-9_108.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:06:29Z","timestamp":1605625589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12868-9_108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540128687","9783540387565"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-12868-9_108","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983]]}}}