100
click to vote
IANDC
2010
15 years 1 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 ...