{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T07:44:01Z","timestamp":1725781441581},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.1993.366815","type":"proceedings-article","created":{"date-parts":[[2002,12,30]],"date-time":"2002-12-30T16:26:32Z","timestamp":1041265592000},"page":"724-733","source":"Crossref","is-referenced-by-count":49,"title":["The hardness of approximate optima in lattices, codes, and systems of linear equations"],"prefix":"10.1109","author":[{"given":"S.","family":"Arora","sequence":"first","affiliation":[]},{"given":"L.","family":"Babai","sequence":"additional","affiliation":[]},{"given":"J.","family":"Stern","sequence":"additional","affiliation":[]},{"given":"Z.","family":"Sweedyk","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336517"},{"journal-title":"Another NP-complete problem and the complexity of computing short vectors in a lattice","year":"0","author":"van emde boas","key":"ref31"},{"key":"ref30","article-title":"Approximating the number of error locations is NP-complete","author":"stern","year":"1993","journal-title":"Proc AAECC-10"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73015"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100225"},{"journal-title":"Combinatorics","year":"1986","author":"bollob\ufffds","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185341"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129783"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.8"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/130385.130431"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90006-3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.415"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62233"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"ref27","first-page":"204","article-title":"Pseudo-random Generators for Logspace Computation","author":"nisan","year":"1990","journal-title":"22nd STOC"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579403"},{"journal-title":"Interactive proofs and approximation","year":"1992","author":"bellare","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90064-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200056"},{"journal-title":"The Complexity of Approximating Non-Linear Programs","year":"1992","author":"bellare","key":"ref8"},{"key":"ref7","first-page":"113","article-title":"Efficient Multi-Prover Interactive Proofs with Applications to Approximation Problems","author":"bellare","year":"1993","journal-title":"20th STOC"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267824"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref1","first-page":"13","article-title":"Proof verification and intractability of approximaion problems","author":"arora","year":"1992","journal-title":"32nd FOCS"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2455.2461"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF02128669"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970203"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"journal-title":"Perceptrons","year":"1968","author":"minsky","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167172"}],"event":{"name":"1993 IEEE 34th Annual Foundations of Computer Science","acronym":"SFCS-93","location":"Palo Alto, CA, USA"},"container-title":["Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx2\/2962\/8405\/00366815.pdf?arnumber=366815","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,8]],"date-time":"2017-03-08T23:44:24Z","timestamp":1489016664000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/366815\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/sfcs.1993.366815","relation":{},"subject":[]}}