{"id":"https://openalex.org/W3034793941","doi":"https://doi.org/10.1145/3357713.3384246","title":"Non-signaling proofs with o(\u221a log n) provers are in PSPACE","display_name":"Non-signaling proofs with o(\u221a log n) provers are in PSPACE","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3034793941","doi":"https://doi.org/10.1145/3357713.3384246","mag":"3034793941"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384246","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384246","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384246","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384246","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066633774","display_name":"Dhiraj Holden","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":false,"raw_author_name":"Dhiraj Holden","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081254473","display_name":"Yael Tauman Kalai","orcid":"https://orcid.org/0009-0002-9406-7734"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"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":false,"raw_author_name":"Yael Tauman Kalai","raw_affiliation_strings":["Microsoft Research, USA / Massachusetts Institute of Technology, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA / Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1632,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.72002838,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"1024","last_page":"1037"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10622","display_name":"Quantum Mechanics and Applications","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10622","display_name":"Quantum Mechanics and Applications","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.995199978351593,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.995199978351593,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.9367856979370117},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.6290218234062195},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.519531786441803},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5148224234580994},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4853912591934204},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4530562460422516},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.4465034306049347},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.428743451833725},{"id":"https://openalex.org/keywords/zero-knowledge-proof","display_name":"Zero-knowledge proof","score":0.4169459342956543},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4023219347000122},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37901291251182556},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35074079036712646},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.302138090133667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2295478880405426}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.9367856979370117},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6290218234062195},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.519531786441803},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5148224234580994},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4853912591934204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4530562460422516},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.4465034306049347},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.428743451833725},{"id":"https://openalex.org/C176329583","wikidata":"https://www.wikidata.org/wiki/Q191943","display_name":"Zero-knowledge proof","level":3,"score":0.4169459342956543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4023219347000122},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37901291251182556},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35074079036712646},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.302138090133667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2295478880405426},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3357713.3384246","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384246","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384246","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/146242","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/146242","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/146242/1/3357713.3384246.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"doi:10.1145/3357713.3384246","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384246","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384246","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6260487398","display_name":"TWC: TTP Option: Frontier: Collaborative: MACS: A Modular Approach to Cloud Security","funder_award_id":"1413920","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3034793941.pdf","grobid_xml":"https://content.openalex.org/works/W3034793941.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1560382869","https://openalex.org/W1590477228","https://openalex.org/W1590594965","https://openalex.org/W1814454000","https://openalex.org/W1998660432","https://openalex.org/W2007997869","https://openalex.org/W2023675273","https://openalex.org/W2029091075","https://openalex.org/W2032606560","https://openalex.org/W2078715027","https://openalex.org/W2085025327","https://openalex.org/W2090133546","https://openalex.org/W2108684595","https://openalex.org/W2113244484","https://openalex.org/W2127851424","https://openalex.org/W2144752539","https://openalex.org/W2148634692","https://openalex.org/W2163656645","https://openalex.org/W2195657359","https://openalex.org/W2283590027","https://openalex.org/W2625723895","https://openalex.org/W2809609136","https://openalex.org/W2885080125","https://openalex.org/W2951003715","https://openalex.org/W2951124766","https://openalex.org/W2951221994","https://openalex.org/W2951723981","https://openalex.org/W4256317935"],"related_works":["https://openalex.org/W2149634854","https://openalex.org/W4400642643","https://openalex.org/W4402530505","https://openalex.org/W2562305209","https://openalex.org/W3030245161","https://openalex.org/W768959333","https://openalex.org/W1999537009","https://openalex.org/W2120766045","https://openalex.org/W2081058418","https://openalex.org/W2982087871"],"abstract_inverted_index":{"Non-signaling":[0],"proofs,":[1,55],"motivated":[2],"by":[3,37,47],"quantum":[4],"computation,":[5],"have":[6],"found":[7],"applications":[8],"in":[9],"cryptography":[10],"and":[11,39],"hardness":[12],"of":[13,23,52],"approximation.":[14],"An":[15],"important":[16],"open":[17,60],"problem":[18],"is":[19,27],"characterizing":[20],"the":[21,50],"power":[22,51],"non-signaling":[24,30,41,54],"proofs.":[25],"It":[26],"known":[28],"that":[29,40],"proofs":[31,42],"with":[32,43],"two":[33],"provers":[34],"are":[35,45],"characterized":[36,46],"PSPACE":[38],"poly(n)-provers":[44],"EXP.":[48],"However,":[49],"k-prover":[53],"for":[56],"2<k<(n)":[57],"remained":[58],"an":[59],"problem.":[61]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}