Determining the winner of a Dodgson election is hard (Q2908877)
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: Determining the winner of a Dodgson election is hard |
scientific article; zbMATH DE number 6073554
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Determining the winner of a Dodgson election is hard |
scientific article; zbMATH DE number 6073554 |
Statements
29 August 2012
0 references
Dodgson score
0 references
parameterized complexity
0 references
kernelization lower bounds
0 references
Determining the winner of a Dodgson election is hard (English)
0 references
0.8942562341690063
0 references
0.8682343363761902
0 references
0.8173194527626038
0 references
0.8136072754859924
0 references
0.812055230140686
0 references
