Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8050459027290344
0 references
0.8028287887573242
0 references
0.7692977786064148
0 references
