29908 search results - page 485 / 5982 » On the Complexity of |
180
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
211
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...