{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:11:15Z","timestamp":1649203875033},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540645900","type":"print"},{"value":"9783540693468","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-69346-7_18","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T15:51:29Z","timestamp":1186069889000},"page":"229-242","source":"Crossref","is-referenced-by-count":7,"title":["Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables"],"prefix":"10.1007","author":[{"given":"Karen","family":"Aardal","sequence":"first","affiliation":[]},{"given":"Cor","family":"Hurkens","sequence":"additional","affiliation":[]},{"given":"Arjen K.","family":"Lenstra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,6,18]]},"reference":[{"key":"18_CR1","unstructured":"K. Aardal, A. K. Lenstra, and C. A. J. Hurkens. An algorithm for solving a diophantine equation with upper and lower bounds on the variables. Report UU-CS-97-40, Department of Computer Science, Utrecht University, 1997. \n ftp:\/\/ftp.cs.ruu.nl\/pub\/RUU\/CS\/techreps\/CS-1997\/"},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1287\/ijoc.5.2.206","volume":"5","author":"W. Cook","year":"1993","unstructured":"W. Cook, T. Rutherford, H. E. Scarf, and D. Shallcross. An implementation of the generalized basis reduction algorithm for integer programming. ORSA Journal on Computing, 5:206\u2013212, 1993.","journal-title":"ORSA Journal on Computing"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"D. Coppersmith. Small solutions to polynomial equations, and low exponent RSA vulnerability. Journal of Cryptology, 10:233\u2013260, 1997.","journal-title":"Journal of Cryptology"},{"key":"18_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/3-540-63397-9_8","volume-title":"Algorithms \u2014 ESA\u2019 97","author":"G. Cornu\u00e9jols","year":"1997","unstructured":"G. Cornu\u00e9jols, R. Urbaniak, R. Weismantel, and L. Wolsey. Decomposition of integer programs and of generating sets. In R. Burkard and G. Woeginger, editors, Algorithms \u2014 ESA\u2019 97, LNCS, Vol. 1284, pages 92\u2013103. Springer-Verlag, 1997."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"M. J. Coster","year":"1992","unstructured":"M. J. Coster, A. Joux, B. A. LaMacchia, A. M. Odlyzko, and C. P. Schnorr. Improved low-density subset sum algorithms. Computational Complexity, 2:111\u2013128, 1992.","journal-title":"Computational Complexity"},{"key":"18_CR6","unstructured":"CPLEX Optimization Inc. Using the CPLEX Callable Library, 1989."},{"key":"18_CR7","unstructured":"B. de Fluiter. A Complexity Catalogue of High-Level Synthesis Problems. Master\u2019s thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1993."},{"key":"18_CR8","volume-title":"Extended gcd and Hermite normal form algorithms via lattice basis reduction","author":"G. Havas","year":"1996","unstructured":"G. Havas, B. S. Majewski, and K. R. Matthews. Extended gcd and Hermite normal form algorithms via lattice basis reduction. Working paper, Department of Mathematics, The University of Queensland, Australia, 1996."},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J. C. Lagarias","year":"1985","unstructured":"J. C. Lagarias and A. M. Odlyzko. Solving low-density subset sum problems. Journal of the Association for Computing Machinery, 32:229\u2013246, 1985.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"18_CR10","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. Lov\u00e1sz. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:515\u2013534, 1982.","journal-title":"Mathematische Annalen"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. W. Lenstra Jr.","year":"1983","unstructured":"H. W. Lenstra, Jr. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8:538\u2013548, 1983.","journal-title":"Mathematics of Operations Research"},{"key":"18_CR12","unstructured":"LiDIA \u2014 A library for computational number theory. TH Darmstadt \/ Universit\u00e4t des Saarlandes, Fachbereich Informatik, Institut f\u00fcr Theoretische Informatik. \n http:\/\/www.informatik.th-darmstadt.de\/pub\/TI\/LiDIA"},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1287\/moor.17.3.751","volume":"17","author":"L. Lov\u00e1sz","year":"1992","unstructured":"L. Lov\u00e1sz and H. E. Scarf. The generalized basis reduction algorithm. Mathematics of Operations Research, 17:751\u2013764, 1992.","journal-title":"Mathematics of Operations Research"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/5.52214","volume":"78","author":"M. C. McFarland","year":"1990","unstructured":"M. C. McFarland, A. C. Parker, and R. Camposano. The high-level synthesis of digital systems. Proceedings of the IEEE, Vol. 78, pages 301\u2013318, 1990.","journal-title":"Proceedings of the IEEE"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C. P. Schnorr","year":"1994","unstructured":"C. P. Schnorr and M. Euchner. Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Mathematical Programming, 66:181\u2013199, 1994.","journal-title":"Mathematical Programming"},{"key":"18_CR16","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 95","author":"C. P. Schnorr","year":"1995","unstructured":"C. P. Schnorr and H. H. H\u00f6rner. Attacking the Chor-Rivest Cryptosystem by improved lattice reduction. In L. C. Guillou and J.-J. Quisquater, editors, Advances in Cryptology \u2014 EUROCRYPT\u2019 95, LNCS, Vol. 921, pages 1\u201312. Springer Verlag, 1995."},{"key":"18_CR17","unstructured":"W. F. J. Verhaegh, P. E. R. Lippens, E. H. L. Aarts, J. H. M. Korst, J. L. van Meerbergen, and A. van der Werf. Modeling periodicity by PHIDEO steams. Proceedings of the Sixth International Workshop on High-Level Synthesis, pages 256\u2013266. ACM\/SIGDA, IEEE\/DATC, 1992."}],"container-title":["Integer Programming and Combinatorial Optimization","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69346-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T21:41:13Z","timestamp":1550439673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69346-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645900","9783540693468"],"references-count":17,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-69346-7_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[1998]]}}}