Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222): 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: 05C69 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6590681 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximation | |||
| Property / zbMATH Keywords: approximation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximum independent set problem | |||
| Property / zbMATH Keywords: maximum independent set problem / rank | |||
Normal rank | |||
Revision as of 21:16, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP |
scientific article |
Statements
Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (English)
0 references
9 June 2016
0 references
computational complexity
0 references
approximation
0 references
maximum independent set problem
0 references
