{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:20:58Z","timestamp":1764688858059},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515173"},{"type":"electronic","value":"9783540482079"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51517-8_89","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:02:45Z","timestamp":1330203765000},"page":"54-63","source":"Crossref","is-referenced-by-count":7,"title":["Computing a lattice basis from a system of generating vectors"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Buchmann","sequence":"first","affiliation":[]},{"given":"Michael","family":"Pohst","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0022-314X(87)90092-8","volume":"26","author":"J. Buchmann","year":"1987","unstructured":"J. Buchmann, On the computation of units and class numbers by a generalization of Lagranges's algorithm, J. Number Theory 26 (1987), 8\u201330.","journal-title":"J. Number Theory"},{"doi-asserted-by":"crossref","unstructured":"J. Buchmann and D. Ford, On the computation of totally real fields of small discriminant, Math. Comp., to appear.","key":"10_CR2","DOI":"10.1090\/S0025-5718-1989-0946599-1"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1090\/S0025-5718-1985-0777278-8","volume":"44","author":"U. Fincke","year":"1985","unstructured":"U. Fincke and M. Pohst, Improved methods for calculating vectors of short length, including a complexity analysis, Math. Comp. 44 (1985), 463\u2013471.","journal-title":"Math. Comp."},{"doi-asserted-by":"crossref","unstructured":"J. Hastad, B. Just, J.C. Lagarias and C.P. Schnorr, Polynomial time algorithms for finding integer relations among real numbers, Proceedings STACS 86.","key":"10_CR4","DOI":"10.1007\/3-540-16078-7_69"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra Jr. and L. Lovasz, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515\u2013534.","journal-title":"Math. Ann."},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0747-7171(87)80061-5","volume":"4","author":"M. Pohst","year":"1987","unstructured":"M. Pohst, A modification of the LLL-algorithm, J. Symb. Comp. 4 (1987),123\u2013127.","journal-title":"J. Symb. Comp."},{"unstructured":"M. Pohst und H. Zassenhaus, Algorithmic algebraic number theory, Cambridge University Press, to appear.","key":"10_CR7"}],"container-title":["Lecture Notes in Computer Science","Eurocal '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51517-8_89.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:04:13Z","timestamp":1619571853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51517-8_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515173","9783540482079"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-51517-8_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}