5 search results - page 1 / 1 » A note on the query complexity of the Condorcet winner probl... |
IPL
2008
13 years 5 months ago
2008
IANDC
2010
13 years 3 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
PODS
1994
ACM
13 years 9 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
PODS
2009
ACM
14 years 5 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...