13603 search results - page 28 / 2721 » On the computational complexity of bridgecard |
163
click to vote
ANTS
1994
Springer
15 years 11 months ago
1994
Springer
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
172
click to vote
TARK
2007
Springer
16 years 29 days ago
2007
Springer
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
183
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
189
click to vote
ICMAS
2000
15 years 8 months ago
2000
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
168
click to vote
TON
2008
15 years 6 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...