The complexity of computing minimal unidirectional covering sets (Q372959): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:04, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of computing minimal unidirectional covering sets |
scientific article |
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
