The complexity of computing minimal unidirectional covering sets (Q372959): Difference between revisions
From MaRDI portal
Changed an Item |
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
||
| description / en | description / en | ||
Revision as of 11:45, 29 April 2024
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of computing minimal unidirectional covering sets |
No description defined |
Statements
The complexity of computing minimal unidirectional covering sets (English)
0 references
21 October 2013
0 references
computational social choice
0 references
computational complexity
0 references
minimal upward covering sets
0 references
minimal downward covering sets
0 references
