4616 search results - page 31 / 924 » The Communication Complexity of Correlation |
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...
STOC
1992
ACM
15 years 6 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
129
click to vote
COLT
2010
Springer
14 years 12 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...
FOCS
1992
IEEE
15 years 5 months ago
1992
IEEE
: We prove in this paper that it is much harder to evaluate depth
123
click to vote
SODA
2000
ACM
15 years 3 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...