{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T14:06:30Z","timestamp":1648562790626},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0020-0190(92)90134-h","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:45:40Z","timestamp":1027640740000},"page":"121-126","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of the closest vector problem in a lattice generated by (0,1)-matrix"],"prefix":"10.1016","volume":"42","author":[{"given":"Boleslaw K.","family":"Szymanski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balaram","family":"Sinharoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90134-H_BIB1","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","article-title":"Minkowski's convex body theorem and integer programming","volume":"12","author":"Kannan","year":"1987","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0020-0190(92)90134-H_BIB2","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0208040","article-title":"Polynomial time algorithms for computing the Smith and Hermite normal forms of an integer matrix","volume":"8","author":"Kannan","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90134-H_BIB3","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reductibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0020-0190(92)90134-H_BIB4","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/0020-0190(92)90134-H_BIB5","series-title":"IEEE Trans. Parallel Distributed Systems","article-title":"Data alignment in SIMD machines","author":"Sinharoy","year":"1991"},{"key":"10.1016\/0020-0190(92)90134-H_BIB6","series-title":"Rept. 81-04","article-title":"Another NP-complete problem and the complexity of computing short vectors in a lattice","author":"van Emde Boas","year":"1981"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290134H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290134H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:21:20Z","timestamp":1555118480000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290134H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["002001909290134H"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90134-h","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}