Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01286987n
Noun Concept
Categories: Mathematics-related lists, NP-complete problems
EN
Karp's 21 NP-complete problems  Karp’s 21 NP-complete problems  Reducibility Among Combinatorial Problems
EN
In computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete. Wikipedia
Definitions
Relations
Sources
EN
In computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete. Wikipedia
Set of computational problems Wikidata
IS A
set
HAS PART
Hamiltonian path problem
job-shop scheduling
knapsack problem
clique cover
feedback vertex set
+13 relations
CARDINALITY OF THIS SET
twenty-one
CREATOR
Richard M. Karp
NAMED AFTER
NP-complete
Richard M. Karp
Wikipedia
EN
Karp's 21 NP-complete problems
Wikidata
EN
Karp's 21 NP-complete problems
Wikipedia Redirections
EN
Karp's 21 NP-Complete Problems, Karp’s 21 NP-complete problems, Reducibility Among Combinatorial Problems

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License