A note on the query complexity of the Condorcet winner problem (Q975500)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the query complexity of the Condorcet winner problem |
scientific article |
Statements
A note on the query complexity of the Condorcet winner problem (English)
0 references
9 June 2010
0 references
analysis of algorithms
0 references
graph algorithms
0 references
theory of computation
0 references
concrete complexity
0 references
social choice
0 references
