The complexity of computing minimal unidirectional covering sets (Q372959)
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: The complexity of computing minimal unidirectional covering sets |
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
