The Complexity of Computing Minimal Unidirectional Covering Sets (Q3563011)
From MaRDI portal
Item:Q3563011
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
28 May 2010
0 references
