Interactive proofs with competing teams of no-signaling provers
From MaRDI portal
Publication:5414626
DOI10.4086/CJTCS.2013.007zbMath1286.68191arXiv1012.0821OpenAlexW1602180687MaRDI QIDQ5414626
Publication date: 7 May 2014
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.0821
Applications of game theory (91A80) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
This page was built for publication: Interactive proofs with competing teams of no-signaling provers