<p>Proving a problem NP-Complete is a research success because it frees you from having to search for an efficient and exact solution for the general problem you are studying.  It proves that your problem is a member of a class of problems so difficult that nobody has been able to find an efficient and exact algorithm for any of the problems, and such a solution for any of the problems would imply a solution for all of the problems.</p>

<p>It is usually a stepping stone, because your problem is still there - you simply have to relax your requirements. Usually people try and figure out how to relax one or more of "efficient", "exact", or "general".  Inefficient-and-exact-and-general is the attempt to find better and better constants in the exponent for these algorithms.  Efficient-and-inexact-and-general is the study of approximation algorithms.  Efficient-and-exact-but-not-general is the study of fixed-parameter tractability and the search for subclasses of input for which efficient algorithms can be found.</p>

CC BY-SA 2.5
2010-12-08T02:48:24.263Z
Nice point for three ways to relax the problem! I guess randomized algorithms falls in the "efficient-and-inexact-and-general" category.
Hsien-Chih Chang 張顯之
CC BY-SA 2.5
2010-12-08T04:21:50.880Z
Really?  Not all randomized algorithms are inexact.
Jeffε
CC BY-SA 2.5
2010-12-08T18:27:24.840Z
And of course you are right, JeffE. Also, I understand you are (or were) instructing a former student of mine in algorithms!  As to Hsien-Chih's point, I don't think randomized algorithms fit well in this scheme.  Certainly some randomized algorithms (genetic algorithms and neural nets come to mind) are inexact yet efficient and general, but some randomized algorithms are quite exact - consider the algorithm for verifying a number is prime!  It's a random algorithm, but I am quite confident that nobody has ever gotten a non-prime out of any reasonable implementation.
Peter Boothe
CC BY-SA 2.5
2010-12-08T01:30:07.863Z
2010-12-08T01:30:07.863Z
Peter Boothe
<p>Let's see two different cases why two different persons would like to prove a problem $NP-complete$:</p>

<p>a) You are working on a software project. Having specified your system , you are starting to define the architecture of your application. This includes breaking down the large problem/need the application serves to smaller problems. Let's say that you have been given the task to find an efficient (we don't want our application to be slow!) algorithm for one of those smaller problems. After struggling for some time, you cannot find a polynomial algorithm. Then you might think: maybe this problem is very hard, so it's very difficult (or even impossible) to find an efficient algorithm. By proving that the problem is $NP-complete$, you have some evidence for this conjecture of yours and you should start considering an alternative approach (e.g. altering the problem so it becomes easier).</p>

<p>b) You are researching complexity theory. By definition, you want to characterize problems (or classes of problems) according to the number of resources needed , i.e. the difficulty to solve them. By proving that a certain problem is $NP-complete$, you gain some insights:</p>

<p>i) You know have a vast knowledge of the problem. Instead of working on a single problem, you can work with the class of $NP-complete$ problems, which might lead you to new insights.</p>

<p>ii) You allow researches that want to prove $P=NP$ another way to do that. Maybe your problem is easier to attack than $3-SAT$.</p>

<p>iii) On the reverse direction, you can use your new problem as a representative of $NP-complete$ problems. By studying it, you can perhaps understand why this problem is so difficult to solve (= does not have an efficient algorithm) and apply this knowledge to all other problems in the class. (that's what Deolalikar tried to do with the $CLIQUE$ problem)</p>

<p>Summarizing, characterizing a problem allows you to use common techniques. By studying the class it is related to, you can think in an abstract level, without bothering about the specifics of this particular problem, which is common in mathematics and science in general. Working with classes instead of individual members allows you to use known techniques and furthermore, apply your insights to a larger number of objects, instead of only one. </p>

CC BY-SA 2.5
2010-12-08T05:51:16.860Z
Many people solve NP-complete problems in practice, even if they're NP-hard to approximate. In the average case many problems turn out to be much easier, although this can be hard to show; it is even harder to prove anything about heuristic algorithms that work well in practice. I suggest the software architect to ask someone whether the problem is "really" difficult before giving up and changing her design.
Yuval Filmus
CC BY-SA 2.5
2010-12-08T11:08:16.350Z
I am not saying that the design needs to change. Using a heuristic or approximation algorithm seems to me (falsely?) like changing the problem... since know you are asking for less precise solutions (are those acceptable? it depends on the application!).
chazisop
CC BY-SA 2.5
2010-12-05T15:07:37.037Z
2010-12-05T15:07:37.037Z
chazisop
<p>I see that previous answers explain why it is important to know if a problem is or is not NP-complete, but none seems to directly address the question: The proof of "$p$ is NP-complete" is <em>not</em> considered a research success for all $p$. It depends on various things, such as whether $p$ is interesting, whether the proof has new techniques, whether "$p$ is NP-complete" has interesting consequences, etc.</p>

CC BY-SA 3.0
2012-01-04T14:55:48.083Z
@Hsien-ChihChang張顯之: I can't comment on that, but those results certainly used to be much more popular a few decades ago. It seems increasingly difficult these days to publish a paper in which you "only" prove a hardness result (with the exception of "famous problems" of course), whereas that would not have been a problem in the 70's-80's, judging from the abundance of this kind of papers during that period.
Anthony Labarre
CC BY-SA 2.5
2010-12-09T11:57:47.210Z
I've heard that there was a time when you proved some problems are NP-complete, you would have your PhD thesis. Is that true?
Hsien-Chih Chang 張顯之
CC BY-SA 2.5
2010-12-09T11:29:44.353Z
2010-12-09T11:29:44.353Z
Radu GRIGore
<p>Each problem has several connections with other problems. In addition, there are relations between a problem and complexity classes.</p>
<p>Therefore, classifying one problem as NPC usually gives us insight into other problems, as well as complexity classes.</p>
<p>For instance, take the <a href="https://en.wikipedia.org/wiki/Graph_isomorphism_problem" rel="nofollow noreferrer">graph isomorphism</a> (GI) problem. In the following paper:</p>
<blockquote>
<p>Uwe Schöning, <a href="https://doi.org/10.1007/BFb0039599" rel="nofollow noreferrer">Graph isomorphism is in the low hierarchy</a>, <em>Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science</em>, 1987, 114–124; also: Journal of Computer and System Sciences, vol. 37 (1988), 312–323.</p>
</blockquote>
<p>it is proven that if GI ∈ NPC, then the <a href="https://en.wikipedia.org/wiki/Polynomial_hierarchy" rel="nofollow noreferrer">polynomial hierarchy</a> (PH) collapses to its second level; which will be a major breakthrough in structural complexity theory.</p>

CC BY-SA 4.0
2010-12-05T00:55:12.253Z
2023-03-03T09:19:26.637Z
2023-03-03T09:19:26.637Z
Sadeq Dousti
<p>Ali, good question.  </p>

<p>Suppose you want to show that some problem P is computationally hard.  Now, you could conjecture that P is hard just based on the fact that we don't have any efficient algorithms for it yet.  But this is rather flimsy evidence, no?  It could be that we have missed some nice way to look at P which would make it very easy to solve.  So, in order to conjecture that P is hard, we would want to accumulate more evidence.  Reductions provide a tool to do exactly that!  If we can reduce some other natural problem Q to P, then we have shown P is at least as hard as Q.  But Q could be a problem from some completely different area of mathematics, and people may have struggled for decades to solve Q also.  Thus, we can view our failure to find an efficient algorithm for Q to be evidence that P is hard.  If we have lots of such Q's from many different problem domains, then we have a huge body of evidence that P is hard.</p>

<p>This is exactly what the theory of NP-completeness provides.  If you prove your problem to be NP-complete, then you have tied its hardness to the hardness of hundreds of other problems, each of significant interest to various communities.  Thus, morally speaking, you can be assured that your problem is indeed hard.</p>

CC BY-SA 2.5
2010-12-05T11:35:40.513Z
So the initial aim is to find an efficient algorithm for P but since that appears unachievable one assumes that P is computationally hard and then your answers explains the rest?
Ali
CC BY-SA 2.5
2010-12-05T17:15:35.337Z
We want to show that our problem P is computationally hard, but we don't want to assume that P is hard to prove that P is hard :) Instead, if you prove P to be NP-complete (or even NP-hard but let's ignore the distinction here), you've shown that if any one out of hundreds of already-well-scrutinized problems is hard, then P is also hard.  This is because if there were an efficient algorithm for P, there would also be efficient algorithms for each of the hundreds of problems.
arnab
CC BY-SA 2.5
2010-12-06T02:58:42.273Z
@Ali: I definitely recommend you to read [Garey and Johnson](http://en.wikipedia.org/wiki/Computers_and_Intractability:_A_Guide_to_the_Theory_of_NP-Completeness).  The famous cartoon in the book is a must-see!
Tsuyoshi Ito
CC BY-SA 2.5
2010-12-05T01:12:55.583Z
2010-12-05T19:49:02.457Z
2010-12-05T19:49:02.457Z
arnab
<p>Am I correct in understanding that proving a problem NP complete is a research success? If so why?</p>

<cc.complexity-theory><np-hardness><big-picture>
Why is it important to prove that a problem is NP-complete?
Ali
# Why is it important to prove that a problem is NP-complete?

(Asked by: username_0 on 2010-12-05)

Am I correct in understanding that proving a problem NP complete is a research success? If so why?

**Tags:** cc.complexity-theory, np-hardness, big-picture


---

## 5 answers

### Answer by username_9 on 2010-12-05. Score: 27 | Accepted answer

username_0, good question.

Suppose you want to show that some problem P is computationally hard. Now, you could conjecture that P is hard just based on the fact that we don't have any efficient algorithms for it yet. But this is rather flimsy evidence, no? It could be that we have missed some nice way to look at P which would make it very easy to solve. So, in order to conjecture that P is hard, we would want to accumulate more evidence. Reductions provide a tool to do exactly that! If we can reduce some other natural problem Q to P, then we have shown P is at least as hard as Q. But Q could be a problem from some completely different area of mathematics, and people may have struggled for decades to solve Q also. Thus, we can view our failure to find an efficient algorithm for Q to be evidence that P is hard. If we have lots of such Q's from many different problem domains, then we have a huge body of evidence that P is hard.

This is exactly what the theory of NP-completeness provides. If you prove your problem to be NP-complete, then you have tied its hardness to the hardness of hundreds of other problems, each of significant interest to various communities. Thus, morally speaking, you can be assured that your problem is indeed hard.

> **Comments:**
> **username_0**: So the initial aim is to find an efficient algorithm for P but since that appears unachievable one assumes that P is computationally hard and then your answers explains the rest?  
> **username_9**: We want to show that our problem P is computationally hard, but we don't want to assume that P is hard to prove that P is hard :) Instead, if you prove P to be NP-complete (or even NP-hard but let's ignore the distinction here), you've shown that if any one out of hundreds of already-well-scrutinized problems is hard, then P is also hard.  This is because if there were an efficient algorithm for P, there would also be efficient algorithms for each of the hundreds of problems.  
> **username_10**: @username_0: I definitely recommend you to read [Garey and Johnson](http://en.wikipedia.org/wiki/Computers_and_Intractability:_A_Guide_to_the_Theory_of_NP-Completeness).  The famous cartoon in the book is a must-see!  

---

### Answer by username_1 on 2010-12-08. Score: 9

Proving a problem NP-Complete is a research success because it frees you from having to search for an efficient and exact solution for the general problem you are studying. It proves that your problem is a member of a class of problems so difficult that nobody has been able to find an efficient and exact algorithm for any of the problems, and such a solution for any of the problems would imply a solution for all of the problems.

It is usually a stepping stone, because your problem is still there - you simply have to relax your requirements. Usually people try and figure out how to relax one or more of "efficient", "exact", or "general". Inefficient-and-exact-and-general is the attempt to find better and better constants in the exponent for these algorithms. Efficient-and-inexact-and-general is the study of approximation algorithms. Efficient-and-exact-but-not-general is the study of fixed-parameter tractability and the search for subclasses of input for which efficient algorithms can be found.

> **Comments:**
> **username_2**: Nice point for three ways to relax the problem! I guess randomized algorithms falls in the "efficient-and-inexact-and-general" category.  
> **username_3**: Really?  Not all randomized algorithms are inexact.  
> **username_1**: And of course you are right, JeffE. Also, I understand you are (or were) instructing a former student of mine in algorithms!  As to Hsien-Chih's point, I don't think randomized algorithms fit well in this scheme.  Certainly some randomized algorithms (genetic algorithms and neural nets come to mind) are inexact yet efficient and general, but some randomized algorithms are quite exact - consider the algorithm for verifying a number is prime!  It's a random algorithm, but I am quite confident that nobody has ever gotten a non-prime out of any reasonable implementation.  

---

### Answer by username_4 on 2010-12-05. Score: 5

Let's see two different cases why two different persons would like to prove a problem $NP-complete$:

a) You are working on a software project. Having specified your system , you are starting to define the architecture of your application. This includes breaking down the large problem/need the application serves to smaller problems. Let's say that you have been given the task to find an efficient (we don't want our application to be slow!) algorithm for one of those smaller problems. After struggling for some time, you cannot find a polynomial algorithm. Then you might think: maybe this problem is very hard, so it's very difficult (or even impossible) to find an efficient algorithm. By proving that the problem is $NP-complete$, you have some evidence for this conjecture of yours and you should start considering an alternative approach (e.g. altering the problem so it becomes easier).

b) You are researching complexity theory. By definition, you want to characterize problems (or classes of problems) according to the number of resources needed , i.e. the difficulty to solve them. By proving that a certain problem is $NP-complete$, you gain some insights:

i) You know have a vast knowledge of the problem. Instead of working on a single problem, you can work with the class of $NP-complete$ problems, which might lead you to new insights.

ii) You allow researches that want to prove $P=NP$ another way to do that. Maybe your problem is easier to attack than $3-SAT$.

iii) On the reverse direction, you can use your new problem as a representative of $NP-complete$ problems. By studying it, you can perhaps understand why this problem is so difficult to solve (= does not have an efficient algorithm) and apply this knowledge to all other problems in the class. (that's what Deolalikar tried to do with the $CLIQUE$ problem)

Summarizing, characterizing a problem allows you to use common techniques. By studying the class it is related to, you can think in an abstract level, without bothering about the specifics of this particular problem, which is common in mathematics and science in general. Working with classes instead of individual members allows you to use known techniques and furthermore, apply your insights to a larger number of objects, instead of only one.

> **Comments:**
> **username_5**: Many people solve NP-complete problems in practice, even if they're NP-hard to approximate. In the average case many problems turn out to be much easier, although this can be hard to show; it is even harder to prove anything about heuristic algorithms that work well in practice. I suggest the software architect to ask someone whether the problem is "really" difficult before giving up and changing her design.  
> **username_4**: I am not saying that the design needs to change. Using a heuristic or approximation algorithm seems to me (falsely?) like changing the problem... since know you are asking for less precise solutions (are those acceptable? it depends on the application!).  

---

### Answer by username_6 on 2010-12-09. Score: 4

I see that previous answers explain why it is important to know if a problem is or is not NP-complete, but none seems to directly address the question: The proof of "$p$ is NP-complete" is *not* considered a research success for all $p$. It depends on various things, such as whether $p$ is interesting, whether the proof has new techniques, whether "$p$ is NP-complete" has interesting consequences, etc.

> **Comments:**
> **username_2**: I've heard that there was a time when you proved some problems are NP-complete, you would have your PhD thesis. Is that true?  
> **username_7**: @Hsien-ChihChang張顯之: I can't comment on that, but those results certainly used to be much more popular a few decades ago. It seems increasingly difficult these days to publish a paper in which you "only" prove a hardness result (with the exception of "famous problems" of course), whereas that would not have been a problem in the 70's-80's, judging from the abundance of this kind of papers during that period.  

---

### Answer by username_8 on 2010-12-05. Score: 3

Each problem has several connections with other problems. In addition, there are relations between a problem and complexity classes.

Therefore, classifying one problem as NPC usually gives us insight into other problems, as well as complexity classes.

For instance, take the [graph isomorphism](https://en.wikipedia.org/wiki/Graph_isomorphism_problem) (GI) problem. In the following paper:

> Uwe Schöning, [Graph isomorphism is in the low hierarchy](https://doi.org/10.1007/BFb0039599), *Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science*, 1987, 114–124; also: Journal of Computer and System Sciences, vol. 37 (1988), 312–323.

it is proven that if GI ∈ NPC, then the [polynomial hierarchy](https://en.wikipedia.org/wiki/Polynomial_hierarchy) (PH) collapses to its second level; which will be a major breakthrough in structural complexity theory.


---

