Computational complexity characterization of protecting elections from bribery (Q5919119)
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: Computational complexity characterization of protecting elections from bribery |
scientific article; zbMATH DE number 7412749
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity characterization of protecting elections from bribery |
scientific article; zbMATH DE number 7412749 |
Statements
Computational complexity characterization of protecting elections from bribery (English)
0 references
21 October 2021
0 references
voting
0 references
complexity
0 references
NP-hardness
0 references
\( \Sigma_2^p\)-hardness
0 references
0 references
