Pages that link to "Item:Q293222"
From MaRDI portal
The following pages link to Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222):
Displaying 6 items.
- Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222) (← links)
- Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- The complexity of Kemeny elections (Q817813) (← links)
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
- Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
