489 search results - page 6 / 98 » Communication Complexity of Permutation-Invariant Functions |
SODA
2012
ACM
12 years 1 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
COLT
2010
Springer
13 years 9 months ago
2010
Springer
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...
CTRSA
2006
Springer
14 years 2 months ago
2006
Springer
In this work, we initiate the study of realizing a ranking functionality (m1,
CC
2007
Springer
13 years 11 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
ITA
2008
13 years 11 months ago
2008
In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equival...