524 search results - page 6 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
TAMC
2007
Springer
14 years 1 months ago
2007
Springer
TOC
2008
13 years 7 months ago
2008
Abstract: Consider the following version of the Hamming distance problem for