The complexity of probabilistic lobbying (Q1662102): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q59864911, #quickstatements; #temporary_batch_1712272666262 |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Paramils / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: SATzilla / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2013.10.003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2569303878 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59864911 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:51, 5 April 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