The complexity of agreement

DOI10.1145/1060590.1060686MaRDI QIDQ3581454zbMATH OpenOpenAlexFDO

Authors Scott Aaronson

Publication date 16 August 2010

Published in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1060590.1060686

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Bayesian problems; characterization of Bayes procedures (62C10) Rationality and learning in game theory (91A26)

Cited in

(5)

• The Riemann hypothesis in computer science
• Resource bounded symmetry of information revisited
• Bayesian decision making in groups is hard
• The communication complexity of functions with large outputs
• Fine hierarchies and m-reducibilities in theoretical computer science

This page was built for publication: The complexity of agreement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581454)