{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:10Z","timestamp":1772283490137,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":65,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642022944","type":"print"},{"value":"9783642022951","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02295-1_9","type":"book-chapter","created":{"date-parts":[[2009,11,18]],"date-time":"2009-11-18T18:20:09Z","timestamp":1258568409000},"page":"293-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The LLL Algorithm and Integer Programming"],"prefix":"10.1007","author":[{"given":"Karen","family":"Aardal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Eisenbrand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,7]]},"reference":[{"key":"9_CR1_9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.2307\/2041711","volume":"55","author":"I Borosh","year":"1976","unstructured":"Borosh, I., Treybig, L.B.: Bounds on positive integral solutions of linear Diophantine equations. Proceedings of the American Mathematical Society 55, 299\u2013304 (1976)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"9_CR2_9","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp 85\u2013103. Plenum Press, NY (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9_CR3_9","unstructured":"Lenstra, Jr., H.W.: Integer programming with a fixed number of variables. Technical Report 81-03, University of Amsterdam, Amsterdam (1981). Available at http:\/\/staff\/science\/uva.nl\/\u223cpeter\/mi8103\/mi8103c.html"},{"issue":"4","key":"9_CR4_9","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, Jr., H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research 8(4), 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"key":"9_CR5_9","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, Jr., H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mahematische Annalen 261, 515\u2013534 (1982)","journal-title":"Mahematische Annalen"},{"key":"9_CR6_9","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"},{"key":"9_CR7_9","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M. Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)","DOI":"10.1007\/978-3-642-97881-4"},{"key":"9_CR8_9","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"9_CR9_9","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"key":"9_CR10_9","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency (3 volumes). Algorithms and Combinatorics 24. Springer, Berlin (2003)"},{"key":"9_CR11_9","doi-asserted-by":"crossref","unstructured":"Cassels, J.W.S.: An Introduction to the Geometry of Numbers. Classics in Mathematics. Springer, Berlin (1997). Second Printing, Corrected, Reprint of the 1971 ed.","DOI":"10.1007\/978-3-642-62035-5_3"},{"key":"9_CR12_9","doi-asserted-by":"crossref","unstructured":"Barvinok, A.: A Course in Convexity. Graduate Studies in Mathematics 54. American Mathematical Society, Providence, RI (2002)","DOI":"10.1090\/gsm\/054"},{"key":"9_CR13_9","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective. The Kluwer International Series in Engineering and Computer Science 671. Kluwer Academic Publishers, Boston, Massachusetts (2002)","DOI":"10.1007\/978-1-4615-0897-7_8"},{"key":"9_CR14_9","unstructured":"Lenstra, Jr., H.W.: Lattices. Chapter 6 in Algorithmic Number Theory, Mathematical Sciences Research Institute Publications, Vol 44, Cambridge University Press, Cambridge, UK, 127\u2013181, 2008."},{"key":"9_CR15_9","volume-title":"An Algorithmic Theory of Numbers","author":"L Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz. An Algorithmic Theory of Numbers, Graphs and Convexity. SIAM, Philadelphia, PA (1986)"},{"key":"9_CR16_9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1146\/annurev.cs.02.060187.001311","volume":"2","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Algorithmic geometry of numbers. Annual Review of Computer Science 2,231\u2013267 (1987)","journal-title":"Annual Review of Computer Science"},{"key":"9_CR17_9","volume-title":"Handbook on Discrete Optimization, Chapter 4","author":"K Aardal","year":"2005","unstructured":"Aardal, K., Eisenbrand, F.: Integer programming, lattices and results in fixed dimension. In: Aardal, K., Nemhauser, G.L., Weismantel, R. (eds) Handbook on Discrete Optimization, Chapter 4. North Holland, Amsterdam (2005)"},{"key":"9_CR18_9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"RE Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society 64, 275\u2013278 (1958)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"9_CR19_9","unstructured":"Gomory, R.E.: An algorithm for integer solutions to linear programs. In: Graves, R.L., Wolfe, P. (eds) Recent Advances in Mathematical Programming, pp 269\u2013302. McGraw-Hill (1963)"},{"key":"9_CR20_9","first-page":"55","volume-title":"History of Mathematical Programming: A Collection of Personal Reminiscences","author":"RE Gomory","year":"1991","unstructured":"Gomory, R.E.: Early integer programming. In: Lenstra, J.K., Rinnooy Kan, A.H.G., Schrijver, A. (eds) History of Mathematical Programming: A Collection of Personal Reminiscences, pp 55\u201361. CWI and North-Holland, Amsterdam (1991)"},{"key":"9_CR21_9","first-page":"339","volume-title":"Activity Analysis of Production and Allocation","author":"GB Dantzig","year":"1951","unstructured":"Dantzig, G.B.: Maximization of a linear function of variables subject to linear inequalities. In: Koopmans, T.C. (ed) Activity Analysis of Production and Allocation, pp 339\u2013347. John Wiley & Sons, New York (1951)"},{"key":"9_CR22_9","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a large-scale traveling-salesman problem. Operations Research 2, 393\u2013410 (1954)","journal-title":"Operations Research"},{"key":"9_CR23_9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/opre.7.1.58","volume":"7","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: On a linear-programming, combinatorial approach to the traveling-salesman problem. Operations Research 7, 58-66 (1959)","journal-title":"Operations Research"},{"key":"9_CR24_9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics 17, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"key":"9_CR25_9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0120887","volume":"12","author":"M Gr\u00f6tschel","year":"1980","unstructured":"Gr\u00f6tschel, M.: On the symmetric traveling salesman problem: Solution of a 120-city problem. Mathematical Programming Study 12, 61\u201377 (1980)","journal-title":"Mathematical Programming Study"},{"key":"9_CR26_9","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/BF01580454","volume":"8","author":"M Gr\u00f6tschel","year":"1975","unstructured":"Gr\u00f6tschel, M., Padberg, M.W.: Partial linear characterizations of the asymmetric traveling salesman problem. Mathematical Programming 8, 378\u2013381 (1975)","journal-title":"Mathematical Programming"},{"key":"9_CR27_9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01582116","volume":"16","author":"M Gr\u00f6tschel","year":"1978","unstructured":"Gr\u00f6tschel, M., Padberg, M.W.: On the symmetric traveling salesman problem I: Inequalities. Mathematical Programming 16, 265\u2013280 (1978)","journal-title":"Mathematical Programming"},{"key":"9_CR28_9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01582117","volume":"16","author":"M Gr\u00f6tschel","year":"1978","unstructured":"Gr\u00f6tschel, M., Padberg, M.W.: On the symmetric traveling salesman problem I: Lifting theorems and facets. Mathematical Programming 16, 281\u2013302 (1978)","journal-title":"Mathematical Programming"},{"key":"9_CR29_9","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E Balas","year":"1975","unstructured":"Balas, E.: Facets of the knapsack polytope. Mathematical Programming 8, 146\u2013164 (1975)","journal-title":"Mathematical Programming"},{"key":"9_CR30_9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"PL Hammer","year":"1975","unstructured":"Hammer, P.L., Johnson, E., Peled, U.N.: Facets of regular 0-1 polytopes. Mathematical Programming 8, 179\u2013206 (1975)","journal-title":"Mathematical Programming"},{"key":"9_CR31_9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"LA Wolsey","year":"1975","unstructured":"Wolsey, L.A.: Faces for a linear inequality in 0-1 variables. Mathematical Programming 8, 165\u2013178 (1975)","journal-title":"Mathematical Programming"},{"key":"9_CR32_9","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A Land","year":"1960","unstructured":"Land, A., Doig, A.: An automatic method of solving discrete programming problems. Econometrica 28, 497\u2013520 (1960)","journal-title":"Econometrica"},{"key":"9_CR33_9","unstructured":"ILOG. Cplex. http:\/\/www.ilog.com\/products\/cplex"},{"key":"9_CR34_9","unstructured":"Dash Optimization. Xpress-mp optimization software. http:\/\/www.dashoptimization.com\/home\/index.html"},{"key":"9_CR35_9","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Papadimitriou, C.H.: On linear characterizations of combinatorial optimization problems. In: 21st Annual Symposium on Foundations of Computer Science, Syracuse, N.Y., pp 1\u20139. IEEE, New York (1980)","DOI":"10.1109\/SFCS.1980.29"},{"key":"9_CR36_9","first-page":"113","volume":"12","author":"A Khinchine","year":"1948","unstructured":"Khinchine, A.: A quantitative formulation of Kronecker\u2019s theory of approximation (in russian). Izvestiya Akademii Nauk SSR Seriya Matematika 12, 113\u2013122 (1948)","journal-title":"Izvestiya Akademii Nauk SSR Seriya Matematika"},{"issue":"3","key":"9_CR37_9","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1287\/moor.17.3.751","volume":"17","author":"L Lov\u00e1sz","year":"1992","unstructured":"Lov\u00e1sz, L., Scarf, H.E.: The generalized basis reduction algorithm. Mathematics of Operations Research 17(3), 751\u2013764 (1992)","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"9_CR38_9","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF02128669","volume":"10","author":"J. Lagarias","year":"1990","unstructured":"Lagarias, J., Lenstra, Jr., H.W., Schnorr, C.: Korkin-zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica 10(4), 333\u2013348 (1990)","journal-title":"Combinatorica"},{"issue":"3","key":"9_CR39_9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02711514","volume":"16","author":"W. Banaszczyk","year":"1996","unstructured":"Banaszczyk, W.: Inequalities for convex bodies and polar reciprocal lattices in I\u200bR n . II. Application of K-convexity. Discrete Computational Geometry 16(3), 305\u2013311 (1996)","journal-title":"Discrete Computational Geometry"},{"issue":"3","key":"9_CR40_9","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Mathematics of Operations Research 12(3), 415\u2013440 (1987)","journal-title":"Mathematics of Operations Research"},{"key":"9_CR41_9","doi-asserted-by":"publisher","first-page":"577","DOI":"10.2307\/1971436","volume":"128","author":"R Kannan","year":"1988","unstructured":"Kannan, R., Lov\u00e1sz, L.: Covering minima and lattice-point-free convex bodies. Annals of Mathematics 128, 577\u2013602 (1988)","journal-title":"Annals of Mathematics"},{"key":"9_CR42_9","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. Proceedings of the 33rd Annual ACM symposium on Theory of Computing, pp 601\u2013610. ACM Press, New York (2001)","DOI":"10.1145\/380752.380857"},{"key":"9_CR43_9","first-page":"248","volume-title":"Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9\u201315, 2000, Proceedings. Lecture Notes in Computer Science 1853","author":"J Bl\u00f6mer","year":"2000","unstructured":"Bl\u00f6mer, J.: Closest vectors, successive minima, and dual HKZ-bases of lattices. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds) Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9\u201315, 2000, Proceedings. Lecture Notes in Computer Science 1853, pp 248\u2013259. Springer, Berlin (2000)"},{"issue":"4","key":"9_CR44_9","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.19.4.769","volume":"19","author":"AI Barvinok","year":"1994","unstructured":"Barvinok, A.I.: A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Mathematics of Operations Research 19(4), 769\u2013779 (1994)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"9_CR45_9","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1287\/moor.22.3.545","volume":"22","author":"ME Dyer","year":"1997","unstructured":"Dyer, M.E., Kannan, R.: On Barvinok\u2019s algorithm for counting lattice points in fixed dimension. Mathematics of Operations Research 22(3), 545\u2013549 (1997)","journal-title":"Mathematics of Operations Research"},{"key":"9_CR46_9","unstructured":"Frumkin, M.A.: Algorithms for the solution in integers of systems of linear equations. In: Fridman, A.A. (ed) Studies in discrete optimization (Russian), pp 97\u2013127, Izdat. \u201cNauka\u201d, Moscow (1976)"},{"key":"9_CR47_9","unstructured":"Frumkin, M.A.: An application of modular arithmetic to the construction of algorithms for the solution of systems of linear equations. Doklady Akademii Nauk SSSR 229(5), 1067\u20131070 (1976) [English translation: Soviet Mathematics Doklady 17, 1165\u20131168 (1976)]"},{"key":"9_CR48_9","doi-asserted-by":"crossref","unstructured":"Gathen, von zur, J., Sieveking, M.: Weitere zum Erf\u00fcllungsproblem polynomial \u00e4quivalente kombinatorische Aufgaben. In: Specker, E. Strassen, V. (eds) Komplexit\u00e4t von Entscheidungsproblemen: Ein Seminar, Lecture Notes in Computer Science 43, pp 49\u201371. Springer, Berlin (1976)","DOI":"10.1007\/3-540-07805-3_5"},{"key":"9_CR49_9","unstructured":"Votjakov, A.A., Frumkin, M.A.: An algorithm for finding the general integer solution of a system of linear equations. In: Studies in discrete optimization (Russian), pp 128\u2013140. Izdat. \u201cNauka\u201d, Moscow (1976)"},{"issue":"1","key":"9_CR50_9","first-page":"173","volume":"12","author":"MA Frumkin","year":"1976","unstructured":"Frumkin, M.A.: An algorithm for the reduction of a matrix of integers to triangular form with power complexity of the computations. \u00c8konomika i Matematicheskie Metody 12(1), 173\u2013178 (1976)","journal-title":"\u00c8konomika i Matematicheskie Metody"},{"issue":"4","key":"9_CR51_9","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0208040","volume":"8","author":"R Kannan","year":"1979","unstructured":"Kannan, R., Bachem, A.: Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM Journal on Computing 8(4), 499\u2013507 (1979)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR52_9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/10586458.1998.10504362","volume":"7","author":"G. Havas","year":"1998","unstructured":"Havas, G., Majewski, B.S., Matthews, K.R.: Extended GCD and Hermite normal form algorithms via lattice basis reduction. Experimental Mathematics 7(2), 125\u2013136 (1998) (Addenda and errata: Experimental Mathematics 8, 179\u2013206)","journal-title":"Experimental Mathematics"},{"issue":"3","key":"9_CR53_9","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1287\/moor.25.3.427.12219","volume":"25","author":"K Aardal","year":"2000","unstructured":"Aardal, K., Hurkens, C.A.J., Lenstra, A.K.: Solving a system of linear Diophantine equations with lower and upper bounds on the variables. Mathematics of Operations Research 25(3), 427\u2013442 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"9_CR54_9","doi-asserted-by":"crossref","unstructured":"Aardal, K.A., Lenstra, A.K.: Hard equality constrained integer knapsacks. Mathematics of Operations Research, 29(3), 724\u2013738 (2004). Erratum: Mathematics of Operations Research 31(4), 846 (2006)","DOI":"10.1287\/moor.1040.0099"},{"key":"9_CR55_9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-008-0236-7","volume":"121","author":"K Aardal","year":"2010","unstructured":"Aardal, K., Wolsey, L.A.: Lattice based extended formulations for integer linear equality systems. Mathematical Programming 121, 337\u2013352 (2010).","journal-title":"Mathematical Programming"},{"key":"9_CR56_9","unstructured":"Gao, L., Zhang, Y.: Computational experience with Lenstra\u2019s algorithm. Technical Report TR02-12, Department of Computational and Applied Mathematics, Rice University, Houston, TX (2002)"},{"issue":"2","key":"9_CR57_9","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1287\/ijoc.5.2.206","volume":"5","author":"W Cook","year":"1993","unstructured":"Cook, W., Rutherford, T., Scarf, H.E., Shallcross, D.: An implementation of the generalized basis reduction algorithm for integer programming. ORSA Journal on Computing 5(2),206\u2013212 (1993)","journal-title":"ORSA Journal on Computing"},{"issue":"3","key":"9_CR58_9","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1287\/ijoc.12.3.192.12635","volume":"12","author":"K Aardal","year":"2000","unstructured":"Aardal, K., Bixby, R.E., Hurkens, C.A.J., Lenstra, A.K., Smeltink, J.W.: Market split and basis reduction: Towards a solution of the Cornu\u00e9jols-Dawande instances. INFORMS Journal on Computing 12(3), 192\u2013202 (2000)","journal-title":"INFORMS Journal on Computing"},{"issue":"4\u20135","key":"9_CR59_9","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16(4\u20135), 498\u2013516 (1996)","journal-title":"Algorithmica"},{"key":"9_CR60_9","doi-asserted-by":"crossref","unstructured":"Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: New results and new trends in computer science (Graz, 1991), Lecture Notes in Computer Science 555, pp 359\u2013370. Springer, Berlin (1991)","DOI":"10.1007\/BFb0038202"},{"key":"9_CR61_9","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/201019.201036","volume":"42","author":"KL Clarkson","year":"1995","unstructured":"Clarkson, K.L.: Las Vegas algorithms for linear and integer programming when the dimension is small. Journal of the Association for Computing Machinery 42, 488\u2013499 (1995)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"9_CR62_9","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F.: Fast integer programming in fixed dimension. In: Battista, G.D., Zwick, U. (eds) Algorithms \u2013 ESA 2003. Lecture Notes in Computer Science 2832, 196\u2013207. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-39658-1_20"},{"issue":"2","key":"9_CR63_9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10107-004-0520-0","volume":"102","author":"F Eisenbrand","year":"2005","unstructured":"Eisenbrand, F., Laue, S.: A linear algorithm for integer programming in the plane. Mathematical Programming 102(2), 249 \u2013 259 (2005)","journal-title":"Mathematical Programming"},{"key":"9_CR64_9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation grosser Zahlen (Fast multiplication of large numbers). Computing 7, 281\u2013292 (1971)","journal-title":"Computing"},{"key":"9_CR65_9","first-page":"215","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2005. Lecture Notes in Computer Science 3494","author":"PQ Nguyen","year":"2003","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Floating-point LLL revisited. In: Cramer, R. (ed) Advances in Cryptology \u2014 EUROCRYPT 2005. Lecture Notes in Computer Science 3494, pp 215\u2013233. Springer, Berlin (2003)"}],"container-title":["Information Security and Cryptography","The LLL Algorithm"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02295-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,17]],"date-time":"2024-03-17T18:29:26Z","timestamp":1710700166000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02295-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022944","9783642022951"],"references-count":65,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02295-1_9","relation":{},"ISSN":["1619-7100"],"issn-type":[{"value":"1619-7100","type":"print"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"7 October 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}