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… (More)
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… (More)
  • figure 1
Is this relevant?
Highly Cited
2014
Highly Cited
2014
*Correspondence: Andrew Lucas, Lyman Laboratory of Physics, Department of Physics, Harvard University, 17 Oxford St., Cambridge… (More)
Is this relevant?
Review
2005
Review
2005
Can NP-complete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Many interesting combinatorial problems were found to be NP-complete. Since there is little hope to solve them fast in the worst… (More)
Is this relevant?
1981
1981
Bandwidth restrictions are considered on several NP-Complete problems, including the following problems: (1) 3-Satisfiability… (More)
  • figure 3
  • figure I
Is this relevant?
Highly Cited
1981
Highly Cited
1981
This paper was motivated by a practical problem related to databases for image processing: given a set of points in the plane… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1981
Highly Cited
1981
We show that for each fixed n 3 it is NP-complete to determine whether an arbitrary graph can be edge-partitioned into subgraphs… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1978
Highly Cited
1978
If π is a graph property, the general node(edge) deletion problem can be stated as follows: Find the minimum number of nodes… (More)
  • figure 2
  • figure 3
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1976
Highly Cited
1976
We show that the STEINER TREE problem and TRAVELING SALESMAN problem for points in the plane are NP-complete when distances are… (More)
  • figure 11
Is this relevant?
Highly Cited
1974
Highly Cited
1974
It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In this… (More)
  • figure I
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?