Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Karp's 21 NP-complete problems

Known as: Karp’s 21 NP-complete problems, Reducibility among combinatorial problems 
In computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete. In his 1972 paper… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We address the question of whether it may be worthwhile to convert certain, now classical, NP-complete problems to one of a… Expand
  • figure 1
Highly Cited
2014
Highly Cited
2014
  • A. Lucas
  • Front. Physics
  • 2014
  • Corpus ID: 10554455
We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21 NP-complete problems. This… Expand
Highly Cited
2001
Highly Cited
2001
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 7
Highly Cited
1994
Highly Cited
1994
Genetic algorithms (GAs) are biologically motivated adaptive systems which have been used, with varying degrees of success, for… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1991
Highly Cited
1991
It is well known that for many NP-complete problems, such as K-Sat, etc., typical cases are easy to solve; so that… Expand
  • figure 3
Highly Cited
1987
Highly Cited
1987
AbstractIn continuous variable, smooth, nonconvex nonlinear programming, we analyze the complexity of checking whether(a)a given… Expand
Highly Cited
1981
Highly Cited
1981
  • I. Holyer
  • SIAM J. Comput.
  • 1981
  • Corpus ID: 13131049
We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The problem remains NP-complete even for… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
1978
Highly Cited
1978
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand
Highly Cited
1976
Highly Cited
1976
Abstract It is widely believed that showing a problem to be NP -complete is tantamount to proving its computational… Expand
  • figure 2
  • figure 3
  • figure 6
  • figure I
  • table 1
Highly Cited
1955
Highly Cited
1955
Theory of Functions of Real VariablesBy Prof. Henry P. Thielman. (Prentice-Hall Mathematics Series.) Pp. xiii + 209. (London… Expand
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
  • figure 3.5