Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP |
scientific article |
Statements
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (English)
0 references
22 February 2006
0 references
0 references
0 references
