Entangled games are hard to approximate

2008

Presented at the Annual IEEE Symposium on Foundations of Computer Science, Philadelphia, PA, USA

Additional Metadata
Publisher	IEEE
Project	Quantum Information Processing
Conference	Annual IEEE Symposium on Foundations of Computer Science
Organisation	Quantum Computing and Advanced System Research
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Kempe, J., Kobayashi, H., Matsumoto, K., Toner, B., & Vidick, T. (2008). Entangled games are hard to approximate. IEEE.

See Also
inProceedings Unique games with entangled provers are easy J. Kempe, O. Regev (Oded) and B.F. Toner (Ben)
inProceedings Unique games with entangled provers are easy J. Kempe, O. Regev (Oded) and B.F. Toner (Ben)

Publication