{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T18:06:42Z","timestamp":1735582002171},"reference-count":18,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T00:00:00Z","timestamp":1373932800000},"content-version":"vor","delay-in-days":9693,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1987]]},"DOI":"10.1016\/0304-3975(87)90064-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"201-224","source":"Crossref","is-referenced-by-count":393,"title":["A hierarchy of polynomial time lattice basis reduction algorithms"],"prefix":"10.1016","volume":"53","author":[{"given":"C.P.","family":"Schnorr","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90064-8_BIB1","series-title":"An Introduction to the Geometry of Numbers","author":"Cassels","year":"1971"},{"key":"10.1016\/0304-3975(87)90064-8_BIB2","series-title":"Tech. Rept.","article-title":"Another NP-complete problem and the complexity of computing short vectors in a lattice","author":"van Emde Boas","year":"1981"},{"key":"10.1016\/0304-3975(87)90064-8_BIB3","series-title":"Report","article-title":"An application of simultaneous approximation in combinatorial optimization","author":"Frank","year":"1985"},{"key":"10.1016\/0304-3975(87)90064-8_BIB4","series-title":"Disquisitiones Arithmeticae","author":"Gauss","year":"1889"},{"key":"10.1016\/0304-3975(87)90064-8_BIB5","series-title":"Proc. 3rd STACS 86, Symp. on Theoretical Aspects of Computer Science","first-page":"105","article-title":"Polynomial time algorithms for finding integer relations among real numbers","volume":"210","author":"Hastad","year":"1985"},{"key":"10.1016\/0304-3975(87)90064-8_BIB6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(85)90067-2","article-title":"Algorithms to construct Minkowski reduced and Hermite reduced lattice bases","volume":"41","author":"Helfrich","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90064-8_BIB7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1515\/crll.1850.40.279","article-title":"Second letter to Jacobi","volume":"40","author":"Hermite","year":"1850","journal-title":"Crelle Journal"},{"key":"10.1016\/0304-3975(87)90064-8_BIB8","first-page":"193","article-title":"Improved algorithms for integer programming and related lattice problems","author":"Kannan","year":"1983","journal-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(87)90064-8_BIB9","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/BF01442795","article-title":"Sur les forms quadratiques","volume":"6","author":"Korkine","year":"1873","journal-title":"Math. Annalen"},{"key":"10.1016\/0304-3975(87)90064-8_BIB10","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0196-6774(80)90021-8","article-title":"Worst case complexity bounds for algorithms in the theory of integral quadratic forms","volume":"1","author":"Lagarias","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(87)90064-8_BIB11","unstructured":"J. C. Lagarias, H.W. Lenstra, Jr. and C.P. Schnorr, Korkine\u2013Zolotareff bases and successive minima of a lattice and its reciprocal lattice, Tech. Rept., MSRI 07718-86, Mathematical Sciences Research Institute, Berkeley."},{"key":"10.1016\/0304-3975(87)90064-8_BIB12","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0304-3975(87)90064-8_BIB13","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Math. Annalen"},{"key":"10.1016\/0304-3975(87)90064-8_BIB14","unstructured":"L. Lov\u00e1sz, An algorithmic theory of numbers, graphs and convexity, Tech. Rept., Universit\u00e4t Bonn."},{"key":"10.1016\/0304-3975(87)90064-8_BIB15","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1515\/crll.1891.107.278","article-title":"\u00dcber die positiven quadratischen Formen und \u00fcber kettenbruch\u00e4hnliche Algorithmen","volume":"107","author":"Minkowski","year":"1891","journal-title":"Crelles Journal f\u00fcr die reine und angewandte mathematik"},{"key":"10.1016\/0304-3975(87)90064-8_BIB16","first-page":"138","article-title":"Disproof of the Mertens conjecture","volume":"357","author":"Odlyzko","year":"1985","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"10.1016\/0304-3975(87)90064-8_BIB17","series-title":"Proc. 13th Coll. on Automata, Languages and Programming","first-page":"359","article-title":"A more efficient algorithm for lattice basis reduction (extended abstract)","volume":"226","author":"Schnorr","year":"1986"},{"key":"10.1016\/0304-3975(87)90064-8_BIB18","series-title":"Proc. 11th Coll. on Automata, Languages and Programming","article-title":"Factorization of univariate integer polynomials by diophantine approximation and by an improved basis reduction algorithm","volume":"172","author":"Sch\u00f6nhage","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900648?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900648?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:52:49Z","timestamp":1555113169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397587900648"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0304397587900648"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90064-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}