{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T05:23:34Z","timestamp":1740633814097,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163661"},{"type":"electronic","value":"9783642163678"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16367-8_20","type":"book-chapter","created":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T15:25:55Z","timestamp":1286465155000},"page":"276-279","source":"Crossref","is-referenced-by-count":1,"title":["Query-Efficient Dictatorship Testing with Perfect Completeness"],"prefix":"10.1007","author":[{"given":"Victor","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","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. ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"issue":"3","key":"20_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 nonapproximability\u2013towards tight results. SIAM Journal on Computing\u00a027(3), 804\u2013915 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-642-03685-9_34","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"V. Chen","year":"2009","unstructured":"Chen, V.: A hypergraph dictatorship test with perfect completeness. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX-RANDOM 2009. LNCS, vol.\u00a05687, pp. 448\u2013461. Springer, Heidelberg (2009)"},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1137\/07068062X","volume":"39","author":"I. Dinur","year":"2009","unstructured":"Dinur, I., Mossel, E., Regev, O.: Conditional Hardness for Approximate Coloring. SIAM Journal on Computing\u00a039(3), 843\u2013873 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-31856-9_16","volume-title":"STACS 2005","author":"L. Engebretsen","year":"2005","unstructured":"Engebretsen, L., Holmerin, J.: More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 194\u2013205. Springer, Heidelberg (2005)"},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00039-001-0332-9","volume":"11","author":"W.T. Gowers","year":"2001","unstructured":"Gowers, W.T.: A new proof of Szemer\u00e9di\u2019s theorem. Geom. Funct. Anal.\u00a011(3), 465\u2013588 (2001)","journal-title":"Geom. Funct. Anal."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Lewin, D., Sudan, M., Trevisan, L.: A tight characterization of NP with 3 query PCPs. In: FOCS, pp. 8\u201317 (1998)","DOI":"10.1109\/SFCS.1998.743424"},{"issue":"4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. of ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"J. of ACM"},{"issue":"7","key":"20_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.4086\/toc.2005.v001a007","volume":"1","author":"J. H\u00e5stad","year":"2005","unstructured":"H\u00e5stad, J., Khot, S.: Query Efficient PCPs with Perfect Completeness. Theory of Computing\u00a01(7), 119\u2013148 (2005)","journal-title":"Theory of Computing"},{"issue":"2","key":"20_CR11","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. Algorithms\u00a022(2), 139\u2013160 (2003)","journal-title":"Random Struct. Algorithms"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: STOC, pp. 767\u2013775 (2002)","DOI":"10.1145\/509907.510017"},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539705447372","volume":"37","author":"S. Khot","year":"2007","unstructured":"Khot, S., Kindler, G., Mossel, E., O\u2019Donnell, R.: Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? SIAM Journal on Computing\u00a037(1), 319\u2013357 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Khot, S., Saket, R.: A 3-Query Non-Adaptive PCP with Perfect Completeness. In: CCC, pp. 159\u2013169 (2006)","DOI":"10.1109\/CCC.2006.5"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Wu, Y.: 3-bit dictator testing: 1 vs. 5\/8. In: SODA, pp. 365\u2013373 (2009)","DOI":"10.1137\/1.9781611973068.41"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Wu, Y.: Conditional Hardness for Satisfiable-3CSPs. In: STOC, pp. 493\u2013502 (2009)","DOI":"10.1145\/1536414.1536482"},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1137\/S0895480101407444","volume":"16","author":"M. Parnas","year":"2002","unstructured":"Parnas, M., Ron, D., Samorodnitsky, A.: Testing Basic Boolean Formulae. SIAM Journal on Discrete Mathematics\u00a016(1), 20\u201346 (2002)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"20_CR18","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 Journal on Computing\u00a027(3), 763\u2013803 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Samorodnitsky, A.: Low-degree tests at large distances. In: STOC, pp. 506\u2013515 (2007)","DOI":"10.1145\/1250790.1250864"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Samorodnitsky, A., Trevisan, L.: A PCP characterization of NP with optimal amortized query complexity. In: STOC, pp. 191\u2013199 (2000)","DOI":"10.1145\/335305.335329"},{"issue":"1","key":"20_CR21","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/070681612","volume":"39","author":"A. Samorodnitsky","year":"2009","unstructured":"Samorodnitsky, A., Trevisan, L.: Gowers uniformity, influence of variables, and PCPs. SIAM Journal on Computing\u00a039(1), 323\u2013360 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Sudan, M., Trevisan, L.: Probabilistically checkable proofs with low amortized query complexity. In: FOCS, pp. 18\u201327 (1998)","DOI":"10.1109\/SFCS.1998.743425"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Tamaki, S., Yoshida, Y.: A query efficient non-adaptive long code test with perfect completeness. ECCC, TR09-074 (2009)","DOI":"10.1007\/978-3-642-15369-3_55"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Tao, T.: Structure and randomness in combinatorics. In: FOCS, pp. 3\u201315 (2007)","DOI":"10.1109\/FOCS.2007.17"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Recycling queries in PCPs and in linearity tests (extended abstract). In: STOC, pp. 299\u2013398 (1998)","DOI":"10.1145\/276698.276769"}],"container-title":["Lecture Notes in Computer Science","Property Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16367-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T13:17:56Z","timestamp":1740575876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16367-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163661","9783642163678"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16367-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}