{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T22:39:06Z","timestamp":1776724746014,"version":"3.51.2"},"reference-count":18,"publisher":"American Mathematical Society (AMS)","issue":"223","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>Integer lattices have numerous important applications, but some of them may have been overlooked because of the common assumption that a lattice basis is part of the problem instance. This paper gives an application that requires finding a basis for a lattice defined in terms of linear constraints. We show how to find such a basis efficiently.<\/p>","DOI":"10.1090\/s0025-5718-98-00936-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T18:14:44Z","timestamp":1027707284000},"page":"1149-1161","source":"Crossref","is-referenced-by-count":0,"title":["A natural lattice basis problem with applications"],"prefix":"10.1090","volume":"67","author":[{"given":"John","family":"Hobby","sequence":"first","affiliation":[]}],"member":"14","published-online":{"date-parts":[[1998]]},"reference":[{"issue":"1","key":"1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","article-title":"On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem","volume":"6","author":"Babai, L.","year":"1986","journal-title":"Combinatorica","ISSN":"https:\/\/id.crossref.org\/issn\/0209-9683","issn-type":"print"},{"key":"2","unstructured":"Charles Bigelow and Kris Holmes, The design of a Unicode font, Elec. Publish. 6 (1993), no. 3, 289\u2013305."},{"issue":"2","key":"3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.5802\/jtnb.113","article-title":"Approximating rings of integers in number fields","volume":"6","author":"Buchmann, J. A.","year":"1994","journal-title":"J. Th\\'{e}or. Nombres Bordeaux","ISSN":"https:\/\/id.crossref.org\/issn\/1246-7405","issn-type":"print"},{"key":"4","series-title":"Graduate Texts in Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A course in computational algebraic number theory","volume":"138","author":"Cohen, Henri","year":"1993","ISBN":"https:\/\/id.crossref.org\/isbn\/3540556400"},{"issue":"2","key":"5","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/0217016","article-title":"Reconstructing truncated integer variables satisfying linear congruences","volume":"17","author":"Frieze, Alan M.","year":"1988","journal-title":"SIAM J. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0097-5397","issn-type":"print"},{"key":"6","unstructured":"E. R. Gansner, An infinite precision integer package for c++, AT&T Bell Laboratories technical memorandum, 1987."},{"issue":"207","key":"7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.2307\/2153568","article-title":"Improved rounding for spline coefficients and knots","volume":"63","author":"Grosse, Eric","year":"1994","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"issue":"5","key":"8","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1137\/0218059","article-title":"Polynomial time algorithms for finding integer relations among real numbers","volume":"18","author":"H\u00e5stad, J.","year":"1989","journal-title":"SIAM J. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0097-5397","issn-type":"print"},{"issue":"2","key":"9","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1137\/0217019","article-title":"Solving simultaneous modular equations of low degree","volume":"17","author":"H\u00e5stad, Johan","year":"1988","journal-title":"SIAM J. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0097-5397","issn-type":"print"},{"key":"10","doi-asserted-by":"crossref","unstructured":"John D. Hobby, Generating automatically tuned bitmaps from outlines, J. ACM 40 (1993), no. 1, 48\u201394.","DOI":"10.1145\/138027.138040"},{"key":"11","series-title":"Addison-Wesley Series in Computer Science and Information Processing","isbn-type":"print","volume-title":"The art of computer programming. Vol. 2","author":"Knuth, Donald E.","year":"1981","ISBN":"https:\/\/id.crossref.org\/isbn\/0201038226","edition":"2"},{"issue":"4","key":"12","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra, A. K.","year":"1982","journal-title":"Math. Ann.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5831","issn-type":"print"},{"issue":"4","key":"13","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra, H. W., Jr.","year":"1983","journal-title":"Math. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0364-765X","issn-type":"print"},{"issue":"4","key":"14","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1109\/TIT.1984.1056942","article-title":"Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir\u2019s fast signature scheme","volume":"30","author":"Odlyzko, Andrew M.","year":"1984","journal-title":"IEEE Trans. Inform. Theory","ISSN":"https:\/\/id.crossref.org\/issn\/0018-9448","issn-type":"print"},{"issue":"1","key":"15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0747-7171(87)80061-5","article-title":"A modification of the LLL reduction algorithm","volume":"4","author":"Pohst, M.","year":"1987","journal-title":"J. Symbolic Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0747-7171","issn-type":"print"},{"issue":"3","key":"16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/bf01933667","article-title":"A Monte Carlo method for factorization","volume":"15","author":"Pollard, J. M.","year":"1975","journal-title":"Nordisk Tidskr. Informationsbehandling (BIT)","ISSN":"https:\/\/id.crossref.org\/issn\/0901-246X","issn-type":"print"},{"issue":"5","key":"17","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1109\/TIT.1984.1056964","article-title":"A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem","volume":"30","author":"Shamir, Adi","year":"1984","journal-title":"IEEE Trans. Inform. Theory","ISSN":"https:\/\/id.crossref.org\/issn\/0018-9448","issn-type":"print"},{"issue":"2","key":"18","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0022-0000(89)90046-9","article-title":"On finite-precision representations of geometric objects","volume":"39","author":"Sugihara, K\u014dkichi","year":"1989","journal-title":"J. Comput. System Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/0022-0000","issn-type":"print"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/1998-67-223\/S0025-5718-98-00936-3\/S0025-5718-98-00936-3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/1998-67-223\/S0025-5718-98-00936-3\/S0025-5718-98-00936-3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T21:48:18Z","timestamp":1776721698000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/1998-67-223\/S0025-5718-98-00936-3\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":18,"journal-issue":{"issue":"223","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["S0025-5718-98-00936-3"],"URL":"https:\/\/doi.org\/10.1090\/s0025-5718-98-00936-3","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[1998]]}}}