Pages that link to "Karp's 21 NP-complete problems"
Jump to navigation
Jump to search
The following pages link to Karp's 21 NP-complete problems:
Displaying 27 items.
- Boolean satisfiability problem (← links)
- P versus NP problem (← links)
- Knapsack problem (← links)
- Linear programming (← links)
- Hamiltonian path problem (← links)
- Polynomial-time reduction (← links)
- Clique problem (← links)
- Richard M. Karp (← links)
- Integer programming (← links)
- Graph coloring (← links)
- Steiner tree problem (← links)
- Clique (graph theory) (← links)
- Vertex cover (← links)
- Cook–Levin theorem (← links)
- Set cover problem (← links)
- List of NP-complete problems (← links)
- Dominating set (← links)
- Feedback vertex set (← links)
- Feedback arc set (← links)
- Set packing (← links)
- Cut (graph theory) (← links)
- Exact cover (← links)
- History of artificial intelligence (← links)
- Karp's 21 NP-Complete Problems (redirect page) (← links)
- Talk:NP-completeness (← links)
- Talk:Exact cover (← links)
- Wiki143:WikiProject Mathematics/List of mathematics articles (K) (← links)