A Two Prover One Round Game with Strong Soundness

DOI10.1109/FOCS.2011.62zbMath1292.68075OpenAlexW1972934214MaRDI QIDQ5494992

Subhash A. Khot, Shmuel Safra

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/focs.2011.62

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items

Quantum de Finetti theorems under local measurements with applications ⋮ Pseudorandom sets in Grassmann graph have near-perfect expansion ⋮ Unnamed Item

This page was built for publication: A Two Prover One Round Game with Strong Soundness