# Karp's 21 NP-complete problems

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

- ArXiv
- 2019

We address the question of whether it may be worthwhile to convert certain, now classical, NP-complete problems to one of aâ€¦Â (More)

Is this relevant?

Highly Cited

2014

Highly Cited

2014

- Front. Physics
- 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

- Electronic Colloquium on Computational Complexity
- 2005

Can NP-complete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, proteinâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- SIAM J. Comput.
- 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

- STOC
- 1981

Bandwidth restrictions are considered on several NP-Complete problems, including the following problems:
(1) 3-Satisfiabilityâ€¦Â (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- Inf. Process. Lett.
- 1981

This paper was motivated by a practical problem related to databases for image processing: given a set of points in the planeâ€¦Â (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- SIAM J. Comput.
- 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)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- STOC
- 1978

If Ï€ is a graph property, the general node(edge) deletion problem can be stated as follows: Find the minimum number of nodesâ€¦Â (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- STOC
- 1976

We show that the STEINER TREE problem and TRAVELING SALESMAN problem for points in the plane are NP-complete when distances areâ€¦Â (More)

Is this relevant?

Highly Cited

1974

Highly Cited

1974

- STOC
- 1974

It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In thisâ€¦Â (More)

Is this relevant?