Pages that link to "Item:Q293222"

The following pages link to Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222):

Displayed 2 items.

• The complexity of Kemeny elections (Q817813) ‎ (← links)
• Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) ‎ (← links)