{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:49Z","timestamp":1772283529177,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"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_107","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:56:17Z","timestamp":1330174577000},"page":"236-244","source":"Crossref","is-referenced-by-count":17,"title":["On the complexity of finding short vectors in integer lattices"],"prefix":"10.1007","author":[{"given":"Erich","family":"Kaltofen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"23_CR1","volume-title":"Matrix Theory, vol. 1","author":"F. R. Gantmacher","year":"1959","unstructured":"Gantmacher, F. R.: Matrix Theory, vol. 1. New York: Chelsea 1959."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Kaltofen, E.: A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization. Proc. 23rd Symp. Foundations of Comp. Sci., IEEE 57\u201364 (1982).","DOI":"10.1109\/SFCS.1982.56"},{"key":"23_CR3","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, 2nd ed. Reading, MA: Addison Wesley 1981.","edition":"2nd ed."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Lagarias, J.C.: The Computational Complexity of Simultaneous Diophantine Approximation Problems. Proc. 23rd Symp. Foundations of Comp. Sci., IEEE 32\u201339 (1982).","DOI":"10.1109\/SFCS.1982.43"},{"key":"23_CR5","volume-title":"Factoring Polynomials with Rational Coefficients. Report 82-05","author":"A. K. Lenstra","year":"1982","unstructured":"Lenstra, A. K., Lenstra, H. W., jr., Lov\u00e1sz, L.: Factoring Polynomials with Rational Coefficients. Report 82-05. Amsterdam: Mathematisch Instituut 1982."},{"key":"23_CR6","unstructured":"Lenstra, H.W., jr.: Integer Programming with a Fixed Number of Variables. Univ. Amsterdam: Math. Inst. Report 81-03, 1981."},{"key":"23_CR7","unstructured":"Odlyzko, A.M.: Private Communications 1982."},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., and Strassen, V.: Schnelle Multiplication grosser Zahlen. Computing 7, 281\u2013292 (1971).","journal-title":"Computing"}],"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_107.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:51:33Z","timestamp":1619542293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12868-9_107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540128687","9783540387565"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-12868-9_107","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983]]}}}