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

DOI10.1145/3357713.3384246OpenAlexW3034793941MaRDI QIDQ5144986

Dhiraj Holden, Yael Tauman Kalai

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.02590

zbMATH Keywords

interactive proofsnon-signalingmulti-prover games

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Non-signaling proofs with o(√ log n) provers are in PSPACE