Non-signaling proofs with o(√ log n) provers are in PSPACE

Dhiraj Holden, Yael Tauman Kalai. Non-signaling proofs with o(√ log n) provers are in PSPACE. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath 0001, Julia Chuzhoy, editors, Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020. pages 1024-1037, ACM, 2020. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.