Ontify
⌘
S
⌘
S
Karp's 21 NP-Complete Problems - Ontify
Share
Karp's 21 NP-Complete Problems
Set of computational problems.
Wikipedia | Karp's 21 NP-Complete Problems
Statements about
Karp's 21 NP-Complete Problems
Named After
Richard M. Karp
NP-Complete
Creator
Richard M. Karp
Has Part(s)
18 items
Boolean Satisfiability Problem
Vertex Cover Problem
3-Satisfiability Problem
Exact Cover
Set Packing
Knapsack Problem
Maximum Cut
Hamiltonian Path Problem
Partition Problem
Clique Cover Problem
Set Cover Problem
Clique Problem
Feedback Arc Set
Feedback Vertex Set
Steiner Tree Problem
Job-Shop Scheduling
3-Dimensional Matching
Chromatic Number
Instance Of
Set
Described by Source
Reducibility Among Combinatorial Problems
Karp Richard M.. Reducibility Among Combinatorial Problems. Complexity of Computer Computations, Proceedings of a Symposium on the Complexity of Computer Computations, Held March 20-22, 1972, at the IBM Thomas J. Watson Center, Yorktown Heights, New
Has Part(s) of the Class
:
Computational Problem
Wikidata