Stop the war!
Остановите войну!
for scientists:
default search action
"Recognizing when heuristics can approximate minimum vertex covers is ..."
Edith Hemaspaandra, Jörg Rothe, Holger Spakowski (2006)
- Edith Hemaspaandra, Jörg Rothe, Holger Spakowski:
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. RAIRO Theor. Informatics Appl. 40(1): 75-91 (2006)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.