The complexity of computing minimal unidirectional covering sets (Q372959): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 91B14 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6217430 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational social choice | |||
| Property / zbMATH Keywords: computational social choice / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimal upward covering sets | |||
| Property / zbMATH Keywords: minimal upward covering sets / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimal downward covering sets | |||
| Property / zbMATH Keywords: minimal downward covering sets / rank | |||
Normal rank | |||
Revision as of 09:54, 29 June 2023
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
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
