Pages that link to "Karp's 21 NP-complete problems"
From HandWiki
The following pages link to Karp's 21 NP-complete problems:
Displayed 30 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Linear programming (← links)
- 3-dimensional matching (← links)
- Cook–Levin theorem (← links)
- Cut (graph theory) (← links)
- Knapsack problem (← links)
- NP-completeness (← links)
- Set cover problem (← links)
- Set packing (← links)
- Wiener connector (← links)
- Graph coloring (← links)
- List of NP-complete problems (← links)
- P versus NP problem (← links)
- Steiner tree problem (← links)
- Feedback arc set (← links)
- Exact cover (← links)
- Satisfiability (← links)
- Boolean satisfiability problem (← links)
- Dominating set (← links)
- Integer programming (← links)
- Clique cover (← links)
- Feedback vertex set (← links)
- Vertex cover (← links)
- Maximum cut (← links)
- Clique problem (← links)
- Hamiltonian path problem (← links)
- Polynomial-time reduction (← links)
- Clique (graph theory) (← links)
- History of artificial intelligence (← links)
- Biography:Eugene Lawler (← links)
- Biography:Richard M. Karp (← links)
