The complexity of computing minimal unidirectional covering sets (Q372959)
From MaRDI portal
(Redirected from Item:Q3563011)
 | 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 |
scientific article; zbMATH DE number 5713750
- The Complexity of Computing Minimal Unidirectional Covering Sets
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of computing minimal unidirectional covering sets |
scientific article; zbMATH DE number 5713750 |
|
Statements
The complexity of computing minimal unidirectional covering sets (English)
0 references
The Complexity of Computing Minimal Unidirectional Covering Sets (English)
0 references
21 October 2013
0 references
28 May 2010
0 references
computational social choice
0 references
computational complexity
0 references
minimal upward covering sets
0 references
minimal downward covering sets
0 references
0 references
0 references
0 references
0 references
0 references
0.90649307
0 references
0 references
0.89209723
0 references
0.89209723
0 references
0.8904295
0 references
