{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:08:30Z","timestamp":1725548910611},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_16","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T13:06:19Z","timestamp":1267535179000},"page":"194-205","source":"Crossref","is-referenced-by-count":12,"title":["More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP"],"prefix":"10.1007","author":[{"given":"Lars","family":"Engebretsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonas","family":"Holmerin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","first-page":"501","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J.\u00a0ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"J.\u00a0ACM"},{"issue":"1","key":"16_CR2","first-page":"70","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. J.\u00a0ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"J.\u00a0ACM"},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/S0097539796302531","volume":"27","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs and non-approximability\u2014towards tight results. SIAM J. Comput.\u00a027(3), 804\u2013915 (1998)","journal-title":"SIAM J. Comput."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Sudan, M.: Improved non-approximability results. In: Proc. 26th STOC, pp. 184\u2013193 (1994)","DOI":"10.1145\/195058.195129"},{"issue":"3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M. Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing correcting with applications to numerical problems. J. Comput. Syst. Sci.\u00a047(3), 549\u2013595 (1993)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. In: Proc. 35th STOC, pp. 595\u2013601 (2003)","DOI":"10.1145\/780542.780629"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1137\/S0895480100380458","volume":"18","author":"L. Engebretsen","year":"2004","unstructured":"Engebretsen, L.: The nonapproximability of non-Boolean predicates. SIAM J. Disc. Math.\u00a018(1), 114\u2013129 (2004)","journal-title":"SIAM J. Disc. Math."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Engebretsen, L., Holmerin, J.: Three-query PCPs with perfect completeness over non-Boolean domains. In: Proc. 18th CCC, pp. 284\u2013299 (2003)","DOI":"10.1109\/CCC.2003.1214428"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Engebretsen, L., Holmerin, J.: More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. Technical Report TRITA-NA-0409, Royal Institute of Technology (April 2004)","DOI":"10.1007\/978-3-540-31856-9_16"},{"issue":"4","key":"16_CR10","first-page":"634","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J.\u00a0ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J.\u00a0ACM"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-27821-4_14","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"G. Hast","year":"2004","unstructured":"Hast, G.: Approximating MAX kCSP using random restrictions. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 151\u2013162. Springer, Heidelberg (2004)"},{"issue":"4","key":"16_CR12","first-page":"798","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J.\u00a0ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"J.\u00a0ACM"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., Khot, S.: Query efficient PCPs with perfect completeness. In: Proc. 42nd FOCS, pp. 610\u2013619 (2001)","DOI":"10.1109\/SFCS.2001.959937"},{"issue":"2","key":"16_CR14","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/rsa.10068","volume":"22","author":"J. H\u00e5stad","year":"2003","unstructured":"H\u00e5stad, J., Wigderson, A.: Simple analysis of graph tests for linearity and PCP. Random Struct. and Alg.\u00a022(2), 139\u2013160 (2003)","journal-title":"Random Struct. and Alg."},{"issue":"3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"Raz, R.: A parallel repetition theorem. SIAM J. Comput.\u00a027(3), 763\u2013803 (1998)","journal-title":"SIAM J. Comput."},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Samorodnitsky, A., Trevisan, L.: A PCP characterization of NP with optimal amortized query complexity. In: Proc. 32nd STOC, pp. 191\u2013199 (2000)","DOI":"10.1145\/335305.335329"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Sudan, M., Trevisan, L.: Probabilistically checkable proofs with low amortized query complexity. In: Proc. 39th FOCS, pp. 18\u201327 (1998)","DOI":"10.1109\/SFCS.1998.743425"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Recycling queries in PCPs and in linearity tests. In: Proc. 30th STOC, pp. 299\u2013308 (1998)","DOI":"10.1145\/276698.276769"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:29:44Z","timestamp":1605742184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}