A note on the query complexity of the Condorcet winner problem (Q975500)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the query complexity of the Condorcet winner problem |
scientific article; zbMATH DE number 5719220
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the query complexity of the Condorcet winner problem |
scientific article; zbMATH DE number 5719220 |
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
0.8031875491142273
0 references
0.7654192447662354
0 references
0.7305838465690613
0 references
0.7274641394615173
0 references
0.7268947958946228
0 references
