The complexity of probabilistic lobbying (Q1662102): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Paramils / rank | |||
Normal rank | |||
Revision as of 16:23, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of probabilistic lobbying |
scientific article |
Statements
The complexity of probabilistic lobbying (English)
0 references
17 August 2018
0 references
computational complexity
0 references
parameterized complexity
0 references
approximability
0 references
computational social choice
0 references
