{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T15:17:04Z","timestamp":1673450224297},"reference-count":14,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"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":[[1993,10]]},"DOI":"10.1016\/0020-0190(93)90076-l","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"301-305","source":"Crossref","is-referenced-by-count":15,"title":["A well-characterized approximation problem"],"prefix":"10.1016","volume":"47","author":[{"given":"Johan","family":"H\u00e5stad","sequence":"first","affiliation":[]},{"given":"Steven","family":"Philips","sequence":"additional","affiliation":[]},{"given":"Shmuel","family":"Safra","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(93)90076-L_BIB1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/rsa.3240030308","article-title":"Simple constructions of almost k-wise independent random variables","volume":"3","author":"Alon","year":"1992","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/0020-0190(93)90076-L_BIB2","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/SFCS.1992.267823","article-title":"Proof verification and intractability of approximation problems","author":"Arora","year":"1992","journal-title":"Proc. 33rd IEEE Symp. on Foundation of Computer Science"},{"key":"10.1016\/0020-0190(93)90076-L_BIB3","author":"Arora","year":"1992","journal-title":"PCP and the hardness of approximation problems"},{"key":"10.1016\/0020-0190(93)90076-L_BIB4","first-page":"1","article-title":"Probabilistic checking of proofs; A new characterization of NP","author":"Arora","year":"1992","journal-title":"Proc. 33rd IEEE Symp. on Foundation of Computer Science"},{"key":"10.1016\/0020-0190(93)90076-L_BIB5","author":"Azar","year":"1993","journal-title":"Approximating arbitrary probability distributions using small sample spaces"},{"key":"10.1016\/0020-0190(93)90076-L_BIB6","first-page":"294","article-title":"Efficient probabilistically checkable proofs; Application to approximation","author":"Bellare","year":"1993","journal-title":"Proc. 25th ACM Symp. on Theory of Computation"},{"key":"10.1016\/0020-0190(93)90076-L_BIB7","unstructured":"M. Bellare and P. Rogaway, The complexity of approximating a nonlinear program, IBM Tech. Rept. RC 17831 (#78493)."},{"key":"10.1016\/0020-0190(93)90076-L_BIB8","series-title":"M.Sc. Thesis (in Computer Science)","article-title":"Construction of small probability spaces for deterministic simulation","author":"Even","year":"1991"},{"key":"10.1016\/0020-0190(93)90076-L_BIB9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/SFCS.1991.185341","article-title":"Approximating clique is almost NP-complete","author":"Feige","year":"1991","journal-title":"Proc. 32nd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90076-L_BIB10","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(93)90076-L_BIB11","first-page":"286","article-title":"On the hardness of approximating minimization problems","author":"Lund","year":"1993","journal-title":"Proc. 25th ACM Symp. on Theory of Computation"},{"key":"10.1016\/0020-0190(93)90076-L_BIB12","doi-asserted-by":"crossref","DOI":"10.1109\/ISTCS.1993.253461","article-title":"The hardness of approximation: Gap location","author":"Petrank","year":"1993","journal-title":"Proc. 2nd Israel Symp. on Theory of Computing and Systems"},{"key":"10.1016\/0020-0190(93)90076-L_BIB13","article-title":"PCP and tighter bounds for approximating MAXSNP","author":"Phillips","year":"1992","journal-title":"Manuscript"},{"key":"10.1016\/0020-0190(93)90076-L_BIB14","first-page":"213","article-title":"Small-bias probability spaces: Efficient constructions and applications","author":"Naor","year":"1990","journal-title":"Proc. 22nd ACM Symp. on Theory of Computing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390076L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390076L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:28:16Z","timestamp":1555144096000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390076L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["002001909390076L"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90076-l","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}