10988 search results - page 168 / 2198 » Algorithmic Folding Complexity |
97
Voted
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
114
Voted
SIGECOM
2005
ACM
15 years 9 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
155
click to vote
COCO
2001
Springer
15 years 8 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
127
Voted
STOC
1991
ACM
15 years 7 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
126
click to vote
DAGSTUHL
2006
15 years 4 months ago
2006
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...