{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:39:37Z","timestamp":1737005977170,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424703"},{"type":"electronic","value":"9783540446668"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_27","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:58:07Z","timestamp":1178211487000},"page":"241-249","source":"Crossref","is-referenced-by-count":3,"title":["The Non-approximability of Non-Boolean Predicates"],"prefix":"10.1007","author":[{"given":"Lars","family":"Engebretsen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"issue":"2","key":"27_CR1","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1006\/jagm.2000.1154","volume":"39","author":"G. Andersson","year":"2001","unstructured":"G. Andersson, L. Engebretsen, and J. H\u00e5stad. A new way of using semidefinite programming with applications to linear equations mod p. J. Alg., 39(2):162\u2013204, May 2001.","journal-title":"J. Alg."},{"issue":"3","key":"27_CR2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501\u2013555, May 1998.","journal-title":"J. ACM"},{"key":"27_CR3","unstructured":"L. Engebretsen. Lower bounds for non-Boolean constraint satisfaction. Technical Report TR00-042, ECCC, June 2000."},{"issue":"4","key":"27_CR4","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634\u2013652, July 1998.","journal-title":"J. ACM"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"U. Feige and M. X. Goemans. Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. In Proc. 3rd ISTCS, pages 182\u2013189, 1995.","DOI":"10.1109\/ISTCS.1995.377033"},{"issue":"6","key":"27_CR6","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. X. Goemans","year":"1995","unstructured":"M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42(6):1115\u20131145, Nov. 1995.","journal-title":"J. ACM"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad. Some optimal inapproximability results. In Proc. 29th STOC, pages 1\u201310, 1997. Accepted for publication in J. ACM.","DOI":"10.1145\/258533.258536"},{"issue":"3","key":"27_CR8","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"R. Raz. A parallel repetition theorem. SIAM J. Comput., 27(3):763\u2013803, June 1998.","journal-title":"SIAM J. Comput."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"A. Samorodnitsky and L. Trevisan. A PCP characterization of NP with optimal amortized query complexity. In Proc. 32nd STOC, pages 191\u2013199, 2000.","DOI":"10.1145\/335305.335329"},{"key":"27_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/BFb0028584","volume-title":"Proc. 15th STACS","author":"M. Serna","year":"1998","unstructured":"M. Serna, L. Trevisan, and F. Xhafa. The (parallel) approximability of non-Boolean satisfiability problems and restricted integer programming. In Proc. 15th STACS, vol. 1373 of LNCS, pages 488\u2013498, 1998. Springer-Verlag."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"M. Sudan and L. Trevisan. Probabilistically checkable proofs with low amortized query complexity. In Proc. 39th FOCS, pages 18\u201327, 1998. IEEE.","DOI":"10.1109\/SFCS.1998.743425"},{"issue":"1","key":"27_CR12","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/PL00009209","volume":"21","author":"L. Trevisan","year":"1998","unstructured":"L. Trevisan. Parallel approximation algorithms by positive linear programming. Algorithmica, 21(1):72\u201388, May 1998.","journal-title":"Algorithmica"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"L. Trevisan. Recycling queries in PCPs and in linearity tests. In Proc. 30th STOC, pages 299\u2013308, 1998.","DOI":"10.1145\/276698.276769"},{"key":"27_CR14","unstructured":"U. Zwick. Approximation algorithms for constraint satisfaction programs involving at most three variables per constraint. In Proc. 9th SODA, pages 201\u2013210, 1998."}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:48:14Z","timestamp":1736988494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}