163 search results - page 1 / 33 » Composition Theorems in Communication Complexity |
64
Voted
ICALP
2010
Springer
15 years 1 months ago
2010
Springer
CSFW
2007
IEEE
15 years 4 months ago
2007
IEEE
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
90
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
80
Voted
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
90
Voted
CORR
2010
Springer
14 years 4 months ago
2010
Springer
We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a general...