{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:10:39Z","timestamp":1770739839800,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540133452","type":"print"},{"value":"9783540388869","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_40","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:03:52Z","timestamp":1330193032000},"page":"436-447","source":"Crossref","is-referenced-by-count":46,"title":["Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm"],"prefix":"10.1007","author":[{"given":"Arnold","family":"Sch\u00f6nhage","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"E. Kaltofen: On the complexity of finding short vectors in integer lattices. Proc. EUROCAL '83, Lecture Notes Comp. Sci.","DOI":"10.1007\/3-540-12868-9_107"},{"key":"40_CR2","volume-title":"Polynomial factorization by root approximation","author":"A. K. Lenstra","year":"1983","unstructured":"A.K. Lenstra: Polynomial factorization by root approximation. Preprint, mathem. centrum, Amsterdam 1983."},{"key":"40_CR3","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":"40_CR4","volume-title":"The fundamental theorem of algebra in terms of computational complexity","author":"A. Sch\u00f6nhage","year":"1982","unstructured":"A. Sch\u00f6nhage: The fundamental theorem of algebra in terms of computational complexity. Preliminary Report, Math. Inst. Univ. T\u00fcbingen, 1982."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:52:50Z","timestamp":1619556770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984]]}}}