The complexity of computing minimal unidirectional covering sets (Q372959): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00224-012-9437-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00224-012-9437-9 / rank | |||
Normal rank | |||
Latest revision as of 01:20, 28 December 2024
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
