{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:51:43Z","timestamp":1725486703849},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679967"},{"type":"electronic","value":"9783540444367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44436-x_13","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T05:33:14Z","timestamp":1182144794000},"page":"120-131","source":"Crossref","is-referenced-by-count":5,"title":["On the Hardness of Approximating NP Witnesses"],"prefix":"10.1007","author":[{"given":"Uriel","family":"Feige","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kobbi","family":"Nissim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy. Proofs Verification and Hardness of Approximation Problems. Journal of the ACM, Vol. 45(3), pp. 501\u2013555, 1998.","journal-title":"Journal of the ACM"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"S. Arora, S. Safra. Probabilistic Checking of Proofs: A new Characterization of NP. Journal of the ACM, Vol. 45(1), pp. 70\u2013122, 1998.","journal-title":"Journal of the ACM"},{"key":"13_CR3","unstructured":"T. H. Cormen, C. E. Leiserson, R. L. Rivest. Introduction to Algorithms. MIT press, 1990."},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/226643.226652","volume":"43","author":"U. Feige","year":"1996","unstructured":"U. Feige, S. Goldwasser, L. Lovasz, S. Safra, M. Szegedy. Interactive Proofs and the Hardness of Approximating Cliques. Journal of ACM, Vol. 43(2), pp. 268\u2013292, 1996.","journal-title":"Journal of ACM"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"A. Gal and S. Halevi and R. Lipton and E. Petrank. Computing from partial solutions. Proc. 14th IEEE Conference on Computational Complexity, pp. 34\u201345, 1999.","DOI":"10.1109\/CCC.1999.766260"},{"key":"13_CR6","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability: A guide to the theory of NP-Completeness. W.H. Freeman, 1979."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey, D.S. Johnson, L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science 1, pp.237\u2013267, 1976.","journal-title":"Theoretical Computer Science"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"O. Goldreich, D. Ron and M. Sudan. Chinese Remaindering with Errors. Proc. 31st Symp. Theory of Computing, pp. 225\u2013234, 1999.","DOI":"10.1145\/301250.301309"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"V. Guruswami and M. Sudan. List Decoding Algorithms for certain Concatenated Codes. Proc. 32nd Symp. Theory of Computing, pp. 181\u2013190, 2000.","DOI":"10.1145\/335305.335327"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad. Some optimal inapproximability results. Proc. 28th Symp. Theory of Computing, pp. 1\u201310, 1997.","DOI":"10.1145\/258533.258536"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"R.M. Karp. Reducibility among Combinatorial Problems. Proc. Symp. Complexity of Computer Computations. Ed. R.E. Miller, J.W. Thatcher, pp. 85\u2013103, 1972.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"R. Kumar and D. Sivakumar. Proofs, Codes, and polynomial-Time Reducibilities. Proc. 14th IEEE Conference on Computational Complexity, pp. 46\u201353, 1999.","DOI":"10.1109\/CCC.1999.766261"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"U. Schoning. A probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems. Proc. 40th IEEE Symp. on Foundations of Computer Science, pp. 410\u2013414, 1999.","DOI":"10.1109\/SFFCS.1999.814612"},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M. Sudan","year":"1997","unstructured":"M. Sudan. Decoding of Reed Solomon codes beyond the error-correction bound. Journal of Complexity 13(1), pp. 180\u2013193, 1997.","journal-title":"Journal of Complexity"},{"issue":"6","key":"13_CR15","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1137\/S0097539794266407","volume":"25","author":"D. Zuckerman","year":"1996","unstructured":"D. Zuckerman. On Unapproximable Versions of NP-Complete Problems. SIAM J.Comput. 25(6), pp. 1293\u20131304, 1996.","journal-title":"SIAM J.Comput."}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44436-X_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T23:55:07Z","timestamp":1556495707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44436-X_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679967","9783540444367"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44436-x_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}