{"id":"https://openalex.org/W2080774683","doi":"https://doi.org/10.1145/2422436.2422461","title":"On the power of many one-bit provers","display_name":"On the power of many one-bit provers","publication_year":2013,"publication_date":"2013-01-03","ids":{"openalex":"https://openalex.org/W2080774683","doi":"https://doi.org/10.1145/2422436.2422461","mag":"2080774683"},"language":"en","primary_location":{"id":"doi:10.1145/2422436.2422461","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2422436.2422461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th conference on Innovations in Theoretical Computer Science","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055776088","display_name":"Per Austrin","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Per Austrin","raw_affiliation_strings":["Aalto Science Institute and KTH Royal Institute of Technology, Helsinki and Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Aalto Science Institute and KTH Royal Institute of Technology, Helsinki and Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013166918","display_name":"Johan H\u00e5stad","orcid":"https://orcid.org/0000-0002-5379-345X"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johan H\u00e5stad","raw_affiliation_strings":["KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081609749","display_name":"Rafael Pass","orcid":"https://orcid.org/0000-0001-7440-5690"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rafael Pass","raw_affiliation_strings":["Cornell University, Ithaca, NY, USA"],"affiliations":[{"raw_affiliation_string":"Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5055776088"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.12697416,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"215","last_page":"220"},"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/T11567","display_name":"semigroups and automata theory","score":0.9987000226974487,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9986000061035156,"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/soundness","display_name":"Soundness","score":0.9147162437438965},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.8123823404312134},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6609145998954773},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5921650528907776},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5549039244651794},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.504419207572937},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.49776580929756165},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4964454770088196},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.4510924816131592},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44081833958625793},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4145588278770447},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.37262672185897827},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2881004214286804},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.23170876502990723},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.22358673810958862},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05771341919898987}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.9147162437438965},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.8123823404312134},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6609145998954773},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5921650528907776},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5549039244651794},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.504419207572937},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.49776580929756165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4964454770088196},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.4510924816131592},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44081833958625793},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4145588278770447},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.37262672185897827},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2881004214286804},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.23170876502990723},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.22358673810958862},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05771341919898987},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2422436.2422461","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2422436.2422461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th conference on Innovations in Theoretical Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.764.8469","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.764.8469","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1301.2729.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1490233153","https://openalex.org/W1670983858","https://openalex.org/W1967935161","https://openalex.org/W1970606468","https://openalex.org/W1974252294","https://openalex.org/W1993625811","https://openalex.org/W1999032440","https://openalex.org/W2019578639","https://openalex.org/W2038202352","https://openalex.org/W2040438296","https://openalex.org/W2080578129","https://openalex.org/W2091921997","https://openalex.org/W2097098285","https://openalex.org/W2097206148","https://openalex.org/W2111385661","https://openalex.org/W2120358419","https://openalex.org/W2133344054","https://openalex.org/W2140797111","https://openalex.org/W2148352980","https://openalex.org/W2148957455","https://openalex.org/W2152221184","https://openalex.org/W2179897858","https://openalex.org/W2405285952","https://openalex.org/W2951899199","https://openalex.org/W2963382491","https://openalex.org/W4246874244","https://openalex.org/W4256317935"],"related_works":["https://openalex.org/W2604424424","https://openalex.org/W2950202488","https://openalex.org/W13634261","https://openalex.org/W4386880013","https://openalex.org/W4250462479","https://openalex.org/W2195657359","https://openalex.org/W3163509751","https://openalex.org/W958050847","https://openalex.org/W2396405675","https://openalex.org/W175051304"],"abstract_inverted_index":{"We":[0,67],"study":[1],"the":[2,31,37,71],"class":[3],"of":[4,39],"languages,":[5],"denoted":[6],"by":[7],"MIP[k,":[8,92,106,119,131,140],"1-\u03b5,":[9,93,107,120,132,142],"s],":[10],"which":[11],"have":[12],"k-prover":[13,78],"games":[14,79],"where":[15],"each":[16],"prover":[17],"just":[18],"sends":[19],"a":[20,81],"single":[21],"bit,":[22],"with":[23,58],"completeness":[24],"1-\u03b5":[25],"and":[26,44,127],"soundness":[27,60],"error":[28],"s.":[29],"For":[30,122,136],"case":[32,38,72],"that":[33,49,69,73],"k=1":[34],"(i.e.,":[35,61],"for":[36,70],"interactive":[40],"proofs),":[41],"Goldreich,":[42],"Vadhan":[43],"Wigderson":[45],"(Computational":[46],"Complexity'02)":[47],"demonstrate":[48,68],"SZK":[50],"exactly":[51],"characterizes":[52],"languages":[53],"having":[54],"1-bit":[55,77],"proof":[56],"systems":[57],"\"non-trivial\"":[59],"1/2":[62],"<":[63,103],"s":[64,87,102,112,123,137],"\u2264":[65,88,101,124],"1-2\u03b5).":[66],"k":[74],"\u2265":[75,113,138],"2,":[76],"exhibit":[80],"significantly":[82],"richer":[83],"structure:":[84],"(Folklore)":[85],"When":[86,97,111],"1/2k":[89,98],"-":[90],"\u03b5,":[91,116],"s]":[94,108,133,143],"=":[95,109,144],"BPP;":[96],"+":[99,115],"\u03b5":[100],"2/2k":[104,114],"-\u03b5,":[105],"SZK;":[110],"AM":[117],"\u2286":[118,134],"s];":[121],"0.62":[125],"k/2k":[126],"sufficiently":[128],"large":[129],"k,":[130],"EXP;":[135],"2k/2k,":[139],"1,":[141],"NEXP.":[145]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}