The complexity of computing minimal unidirectional covering sets (Q6826413)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6217430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of computing minimal unidirectional covering sets |
scientific article; zbMATH DE number 6217430 |
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
