On the parameterized complexity of party nominations (Q2290374)
From MaRDI portal
!
WARNING
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 7158262
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterized complexity of party nominations |
scientific article; zbMATH DE number 7158262 |
Statements
On the parameterized complexity of party nominations (English)
0 references
27 January 2020
0 references
voting rule
0 references
candidate election
0 references
party nominations
0 references
NP-hardness
0 references
0.7960627675056458
0 references
0.7836891412734985
0 references
0.7684400677680969
0 references
0.7673723101615906
0 references
0.7647864818572998
0 references
