zbMATH — the first resource for mathematics

On the power of unique 2-prover 1-round games. (English) Zbl 1192.68367
Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19–21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 767-775, electronic only (2002).
For the entire collection see [Zbl 1074.68502].

68Q25 Analysis of algorithms and problem complexity
68Q15 Complexity classes (hierarchies, relations among complexity classes, etc.)
PDF BibTeX Cite
Full Text: DOI