{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:08Z","timestamp":1750220768487,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["MACS - CNS-1413"],"award-info":[{"award-number":["MACS - CNS-1413"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384246","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"1024-1037","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Non-signaling proofs with o(\u221a log n) provers are in PSPACE"],"prefix":"10.1145","author":[{"given":"Dhiraj","family":"Holden","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yael Tauman","family":"Kalai","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA \/ Massachusetts Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200056"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188924"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34805-0_44"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0057658"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055497"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80026-1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2019.25"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2004.1313847"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90152-2"},{"key":"e_1_3_2_1_10_1","unstructured":"Cynthia Dwork Michael Langberg Moni Naor Kobbi Nissim and Omer Reingold. 2004. Succinct proofs for NP and spooky interactions. Unpublished manuscript available at http:\/\/www.cs.bgu.ac.il\/~kobbi\/papers\/spooky_sub_crypto.pdf.  Cynthia Dwork Michael Langberg Moni Naor Kobbi Nissim and Omer Reingold. 2004. Succinct proofs for NP and spooky interactions. Unpublished manuscript available at http:\/\/www.cs.bgu.ac.il\/~kobbi\/papers\/spooky_sub_crypto.pdf."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258644"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"e_1_3_2_1_13_1","volume-title":"No-Signaling Proofs with O(\u221a (log n)) Provers are in PSPACE. CoRR, abs\/1910.02590","author":"Holden Dhiraj","year":"2019","unstructured":"Dhiraj Holden and Yael Kalai . 2019. No-Signaling Proofs with O(\u221a (log n)) Provers are in PSPACE. CoRR, abs\/1910.02590 ( 2019 ), arxiv:1910.02590. arxiv:1910.02590 Dhiraj Holden and Yael Kalai. 2019. No-Signaling Proofs with O(\u221a (log n)) Provers are in PSPACE. CoRR, abs\/1910.02590 (2019), arxiv:1910.02590. arxiv:1910.02590"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250852"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316367"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14165-2_13"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.22"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_4"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316411"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840750"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488679"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591809"},{"volume-title":"In Symposium on the Foundations of Modern Physics. 441\u2013460","author":"Leonid","key":"e_1_3_2_1_23_1","unstructured":"Leonid A. Khalfin and Boris S. Tsirelson. 1985. Quantum and quasi-classical analogs of Bell inequalities . In In Symposium on the Foundations of Modern Physics. 441\u2013460 . Leonid A. Khalfin and Boris S. Tsirelson. 1985. Quantum and quasi-classical analogs of Bell inequalities. In In Symposium on the Foundations of Modern Physics. 441\u2013460."},{"key":"e_1_3_2_1_24_1","volume-title":"Parallel repetition and concentration for (sub-)no-signalling games via a flexible constrained de Finetti reduction. CoRR, abs\/1506.07002","author":"Lancien Cecilia","year":"2015","unstructured":"Cecilia Lancien and Andreas Winter . 2015. Parallel repetition and concentration for (sub-)no-signalling games via a flexible constrained de Finetti reduction. CoRR, abs\/1506.07002 ( 2015 ), arxiv:1506.07002. arxiv:1506.07002 Cecilia Lancien and Andreas Winter. 2015. Parallel repetition and concentration for (sub-)no-signalling games via a flexible constrained de Finetti reduction. CoRR, abs\/1506.07002 (2015), arxiv:1506.07002. arxiv:1506.07002"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89518"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02058098"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00739036"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225181"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90194-M"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89519"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959930"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC '20"},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384246","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384246","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:12Z","timestamp":1750200072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":31,"alternative-id":["10.1145\/3357713.3384246","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384246","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}