133 search results - page 15 / 27 » Lower Bounds on the Randomized Communication Complexity of R... |
106
click to vote
PODS
2012
ACM
13 years 1 days ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
ECCC
2008
14 years 9 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
IJCAI
2007
14 years 11 months ago
2007
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...