{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:18:29Z","timestamp":1648923509029},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5342,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0304-3975(97)00118-7","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"287-297","source":"Crossref","is-referenced-by-count":1,"title":["On the hardness of approximating shortest integer relations among rational numbers"],"prefix":"10.1016","volume":"209","author":[{"given":"Carsten","family":"R\u00f6ssner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Pierre","family":"Seifert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00118-7_BIB1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(94)00254-G","article-title":"The complexity and approximability of finding maximum feasible subsystems of linear relations","volume":"147","author":"Amaldi","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00118-7_BIB2","article-title":"On the approximability of removing the smallest number of relations from linear systems to achieve feasibility","author":"Amaldi","year":"1995"},{"key":"10.1016\/S0304-3975(97)00118-7_BIB3","article-title":"Probabilistic checking of proofs and hardness of approximation problems","author":"Arora","year":"1994"},{"key":"10.1016\/S0304-3975(97)00118-7_BIB4","series-title":"Proc. 34th IEEE Symp. on Foundations of Computer Science","first-page":"724","article-title":"The hardness of approximate optima in lattices, codes and systems of linear equations","author":"Arora","year":"1993"},{"key":"10.1016\/S0304-3975(97)00118-7_BIB5","series-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science","first-page":"14","article-title":"Proof verification and hardness of approximation problems","author":"Arora","year":"1992"},{"key":"10.1016\/S0304-3975(97)00118-7_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(94)00291-P","article-title":"Approximate solutions of NP optimization problems","volume":"150","author":"Ausiello","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00118-7_BIB7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0890-5401(88)90031-4","article-title":"On the limits of computations with the floor function","volume":"78","author":"Babai","year":"1988","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(97)00118-7_BIB8","series-title":"Proc. 27th ACM Symp. Theory of Computing","first-page":"457","article-title":"Impossibility results for recycling random bits in two-prover proof systems","author":"Feige","year":"1995"},{"key":"10.1016\/S0304-3975(97)00118-7_BIB9","series-title":"Proc. 24th ACM Symp. Theory of Computing","first-page":"643","article-title":"Two-prover one-round proof systems: their power and their problems","author":"Feige","year":"1992"},{"key":"10.1016\/S0304-3975(97)00118-7_BIB10","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1137\/0218059","article-title":"Polynomial time algorithms for finding integer relations among real numbers","volume":"18","author":"H\u00e5stad","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00118-7_BIB11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/322358.322368","article-title":"Polynomial-time aggregation of integer programming problems","volume":"30","author":"Kannan","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00118-7_BIB12","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1090\/S0025-5718-1988-0917831-4","article-title":"Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers","volume":"50","author":"Kannan","year":"1988","journal-title":"Math. Comput."},{"key":"10.1016\/S0304-3975(97)00118-7_BIB13","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0214016","article-title":"The computational complexity of simultaneous diophantine approximation problems","volume":"14","author":"Lagarias","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00118-7_BIB14","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","article-title":"On the hardness of minimization problems","volume":"41","author":"Lund","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00118-7_BIB15","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0304-3975(97)00118-7_BIB16","series-title":"Proc. 27th ACM Symp. Theory of Computing","first-page":"447","article-title":"A parallel repetition theorem","author":"Raz","year":"1995"},{"key":"10.1016\/S0304-3975(97)00118-7_BIB17","article-title":"Another NP-complete partition problem and the complexity of computing short vectors in a lattice","author":"van Emde Boas","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001187?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001187?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:02:42Z","timestamp":1555419762000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0304397597001187"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00118-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}