The complexity of agreement

Scott Aaronson. The complexity of agreement. In Harold N. Gabow, Ronald Fagin, editors, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005. pages 634-643, ACM, 2005. [doi]

Authors

Scott Aaronson

This author has not been identified. Look up 'Scott Aaronson' in Google