Polynomial-Space Approximation of No-Signaling Provers

DOI10.1007/978-3-642-14165-2_13zbMath1287.68051OpenAlexW2127851424MaRDI QIDQ3587375

Tsuyoshi Ito

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_13

Mathematics Subject Classification ID

Applications of game theory (91A80) Signaling and communication in game theory (91A28) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (7)

Quantum de Finetti theorems under local measurements with applications ⋮ Arguments of Proximity ⋮ Interactive Oracle Proofs ⋮ Bridging the gap between general probabilistic theories and the device-independent framework for nonlocality and contextuality ⋮ Optimal non-signalling violations via tensor norms ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Polynomial-Space Approximation of No-Signaling Provers