{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T22:24:34Z","timestamp":1748384674841,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229343"},{"type":"electronic","value":"9783642229350"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22935-0_44","type":"book-chapter","created":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T09:20:39Z","timestamp":1313140839000},"page":"519-529","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Probabilistically Checkable Debates"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Drucker","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"44_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"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. In: 31st IEEE FOCS, pp. 16\u201325 (1990)","DOI":"10.1109\/FSCS.1990.89520"},{"issue":"4","key":"44_CR3","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S0097539705446810","volume":"36","author":"E. Ben-Sasson","year":"2006","unstructured":"Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.P.: Robust PCPs of proximity, shorter PCPs, and applications to coding. SIAM J. Comput.\u00a036(4), 889\u2013974 (2006)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"44_CR4","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1002\/rsa.20120","volume":"28","author":"E. Ben-Sasson","year":"2006","unstructured":"Ben-Sasson, E., Sudan, M.: Robust locally testable codes and products of codes. Random Struct. Algorithms\u00a028(4), 387\u2013402 (2006)","journal-title":"Random Struct. Algorithms"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Braverman, M.: Towards deterministic tree code constructions. Electronic Colloquium on Computational Complexity (ECCC) TR11-064 (2011)","DOI":"10.1145\/2090236.2090250"},{"key":"44_CR6","doi-asserted-by":"crossref","unstructured":"Braverman, M., Rao, A.: Towards coding for maximum errors in interactive communication. In: 43rd ACM STOC, pp. 159\u2013166 (1990)","DOI":"10.1145\/1993636.1993659"},{"issue":"1","key":"44_CR7","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. J. ACM\u00a028(1), 114\u2013133 (1981)","journal-title":"J. ACM"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Stockmeyer, L.J.: Alternation. In: 17th IEEE FOCS, pp. 98\u2013108 (1976)","DOI":"10.1109\/SFCS.1976.4"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Condon, A., Feigenbaum, J., Lund, C., Shor, P.W.: Probabilistically checkable debate systems and nonapproximability of PSPACE-hard functions. Chicago J. Theor. Comput. Sci.\u00a0(1995)","DOI":"10.4086\/cjtcs.1995.004"},{"issue":"2","key":"44_CR10","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/S0097539793260738","volume":"26","author":"A. Condon","year":"1997","unstructured":"Condon, A., Feigenbaum, J., Lund, C., Shor, P.W.: Random debaters and the hardness of approximating stochastic functions. SIAM J. Comput.\u00a026(2), 369\u2013400 (1997)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"44_CR11","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1236457.1236459","volume":"54","author":"I. Dinur","year":"2007","unstructured":"Dinur, I.: The PCP theorem by gap amplification. J. ACM\u00a054(3), 12 (2007)","journal-title":"J. ACM"},{"issue":"4","key":"44_CR12","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1137\/S0097539705446962","volume":"36","author":"I. Dinur","year":"2006","unstructured":"Dinur, I., Reingold, O.: Assignment testers: Towards a combinatorial proof of the PCP theorem. SIAM J. Comput.\u00a036(4), 975\u20131024 (2006)","journal-title":"SIAM J. Comput."},{"key":"#cr-split#-44_CR13.1","unstructured":"Drucker, A.: A PCP characterization of AM. Electronic Colloquium on Computational Complexity (ECCC) TR10-019 (2010);"},{"key":"#cr-split#-44_CR13.2","unstructured":"To appear in ICALP 2011"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Fortnow, L.: Beyond NP: The work and legacy of Larry Stockmeyer. In: 37th ACM STOC, pp. 120\u2013127 (2005)","DOI":"10.1145\/1060590.1060609"},{"issue":"1","key":"44_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jcss.2010.06.007","volume":"77","author":"L. Fortnow","year":"2011","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci.\u00a077(1), 91\u2013106 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"44_CR16","doi-asserted-by":"crossref","unstructured":"Gelles, R., Sahai, A.: Potent tree codes and their applications: Coding for interactive communication, revisited. ArXiv e-prints (April 2011)","DOI":"10.1109\/FOCS.2011.51"},{"key":"44_CR17","unstructured":"Ko, K.-I., Lin, C.-L.: Non-approximability in the polynomial-time hierarchy. TR 94-2, Dept. of Computer Science. SUNY at Stony Brook (1994)"},{"key":"44_CR18","doi-asserted-by":"crossref","unstructured":"Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic methods for interactive proof systems. In: 31st IEEE FOCS, pp. 2\u201310 (1990)","DOI":"10.1109\/FSCS.1990.89518"},{"key":"44_CR19","unstructured":"Moitra, A.: Efficiently coding for interactive communication. Electronic Colloquium on Computational Complexity (ECCC) TR11-042 (2011)"},{"issue":"6","key":"44_CR20","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1109\/18.556671","volume":"42","author":"L.J. Schulman","year":"1996","unstructured":"Schulman, L.J.: Coding for interactive communication. IEEE Trans. Inf. Theory\u00a042(6), 1745\u20131756 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"44_CR21","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1145\/146585.146609","volume":"39","author":"A. Shamir","year":"1992","unstructured":"Shamir, A.: IP = PSPACE. J. ACM\u00a039(4), 869\u2013877 (1992)","journal-title":"J. ACM"},{"issue":"6","key":"44_CR22","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"D.A. Spielman","year":"1996","unstructured":"Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inf. Theory\u00a042(6), 1723\u20131731 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"44_CR23","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time (preliminary report). In: 5th ACM STOC, pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"},{"issue":"1","key":"44_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L.J. Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. Theor. Comput. Sci.\u00a03(1), 1\u201322 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"44_CR25","unstructured":"Williams, R.: Non-linear time lower bound for (succinct) quantified Boolean formulas. Electronic Colloquium on Computational Complexity (ECCC) TR08-076 (2008)"},{"issue":"1","key":"44_CR26","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","volume":"3","author":"C. Wrathall","year":"1976","unstructured":"Wrathall, C.: Complete sets and the polynomial-time hierarchy. Theor. Comput. Sci.\u00a03(1), 23\u201333 (1976)","journal-title":"Theor. Comput. Sci."}],"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\/978-3-642-22935-0_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T15:18:25Z","timestamp":1741447105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22935-0_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229343","9783642229350"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22935-0_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}