99 search results - page 1 / 20 » New strong direct product results in communication complexit... |
ECCC
2011
13 years 2 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
CORR
2010
Springer
13 years 2 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...
STOC
1997
ACM
13 years 12 months ago
1997
ACM
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
CORR
2010
Springer
13 years 6 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 ...
TOC
2010
13 years 2 months ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...