{"id":"https://openalex.org/W1582928986","doi":"https://doi.org/10.1007/978-3-642-22935-0_44","title":"Efficient Probabilistically Checkable Debates","display_name":"Efficient Probabilistically Checkable Debates","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1582928986","doi":"https://doi.org/10.1007/978-3-642-22935-0_44","mag":"1582928986"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-22935-0_44","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-22935-0_44","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/2600a8a1-35ff-40e7-bcf4-4e4c48f685e3","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037697309","display_name":"Andrew Drucker","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew Drucker","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA","Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037697309"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3891,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":null,"first_page":"519","last_page":"529"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.7943037748336792},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.7026607990264893},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5842512249946594},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.569414496421814},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5608296394348145},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5148414969444275},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.4902380108833313},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4764138460159302},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.43234074115753174},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42240041494369507},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.41134387254714966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4031514525413513},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3696710169315338},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3669080138206482},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.279879629611969},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.10066491365432739},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07795077562332153},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.07362133264541626}],"concepts":[{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.7943037748336792},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.7026607990264893},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5842512249946594},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.569414496421814},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5608296394348145},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5148414969444275},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.4902380108833313},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4764138460159302},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.43234074115753174},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42240041494369507},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.41134387254714966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4031514525413513},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3696710169315338},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3669080138206482},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.279879629611969},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.10066491365432739},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07795077562332153},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.07362133264541626},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-642-22935-0_44","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-22935-0_44","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.471.5358","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.471.5358","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2011/073/download/","raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/2600a8a1-35ff-40e7-bcf4-4e4c48f685e3","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/2600a8a1-35ff-40e7-bcf4-4e4c48f685e3","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Drucker, A 2011, Efficient Probabilistically Checkable Debates. in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings. vol. 6845, pp. 519-529. https://doi.org/10.1007/978-3-642-22935-0_44","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/2600a8a1-35ff-40e7-bcf4-4e4c48f685e3","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11820/2600a8a1-35ff-40e7-bcf4-4e4c48f685e3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Drucker, A 2011, Efficient Probabilistically Checkable Debates. in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings. vol. 6845, pp. 519-529. https://doi.org/10.1007/978-3-642-22935-0_44","raw_type":"contributionToPeriodical"},{"id":"mag:1582928986","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc18.html#Drucker11","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/2600a8a1-35ff-40e7-bcf4-4e4c48f685e3","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/2600a8a1-35ff-40e7-bcf4-4e4c48f685e3","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Drucker, A 2011, Efficient Probabilistically Checkable Debates. in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings. vol. 6845, pp. 519-529. https://doi.org/10.1007/978-3-642-22935-0_44","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W769408","https://openalex.org/W159299097","https://openalex.org/W1686539397","https://openalex.org/W1970278864","https://openalex.org/W1996184580","https://openalex.org/W1998084650","https://openalex.org/W1998964055","https://openalex.org/W2003497308","https://openalex.org/W2022350090","https://openalex.org/W2026670837","https://openalex.org/W2038691311","https://openalex.org/W2041058635","https://openalex.org/W2044199052","https://openalex.org/W2065251436","https://openalex.org/W2079584895","https://openalex.org/W2100020751","https://openalex.org/W2113244484","https://openalex.org/W2115551261","https://openalex.org/W2134839489","https://openalex.org/W2135393523","https://openalex.org/W2148352980","https://openalex.org/W2165318736","https://openalex.org/W2293988196","https://openalex.org/W4229760579","https://openalex.org/W4241108585","https://openalex.org/W4242214925","https://openalex.org/W4251893211"],"related_works":["https://openalex.org/W2295591259","https://openalex.org/W2080131634","https://openalex.org/W2156708311","https://openalex.org/W2952260275","https://openalex.org/W13404512","https://openalex.org/W3183430051","https://openalex.org/W2110783418","https://openalex.org/W2137467444","https://openalex.org/W3174634921","https://openalex.org/W2416431186","https://openalex.org/W2576633881","https://openalex.org/W2083124087","https://openalex.org/W2402663702","https://openalex.org/W53264231","https://openalex.org/W2089421253","https://openalex.org/W3030786901","https://openalex.org/W2949886604","https://openalex.org/W2952904871","https://openalex.org/W2511425861","https://openalex.org/W3195592227"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}