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]
@inproceedings{Aaronson05,
title = {The complexity of agreement},
author = {Scott Aaronson},
year = {2005},
doi = {10.1145/1060590.1060686},
url = {http://doi.acm.org/10.1145/1060590.1060686},
researchr = {https://researchr.org/publication/Aaronson05},
cites = {0},
citedby = {0},
pages = {634-643},
booktitle = {Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005},
editor = {Harold N. Gabow and Ronald Fagin},
publisher = {ACM},
isbn = {1-58113-960-8},
}