The complexity of Kemeny elections (Q817813)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5013315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of Kemeny elections |
scientific article; zbMATH DE number 5013315 |
Statements
The complexity of Kemeny elections (English)
0 references
20 March 2006
0 references
computational complexity
0 references
election systems
0 references
parallel access to NP
0 references
0 references
0.8551816
0 references
0 references
0.80478406
0 references
0.79014075
0 references
0.7892787
0 references
0 references
