<p>You might be interested in Scott Aaronson's talk "<a href="http://www.scottaaronson.com/talks/pvsnpcsw.ppt">Has There Been Progress on the P vs. NP Question?</a>" (<a href="http://www.scottaaronson.com/talks/pvsnp.ppt">earlier version</a>)</p>

CC BY-SA 3.0
2012-02-03T06:56:57.060Z
2012-02-03T06:56:57.060Z
Martin Schwarz
<p>For what concern "... what approaches have been taken and (in all probability) <strong>failed</strong> ...", see the <a href="http://www.win.tue.nl/~gwoegi/P-versus-NP.htm">P-versus-NP Page</a> that collects links to papers/authors that try to settle the "P versus NP" question (in either way) :-)</p>

CC BY-SA 3.0
2012-02-03T08:14:50.827Z
2012-02-03T08:14:50.827Z
Marzio De Biasi
<p>I know that it is still one of the biggest mysteries of computer science whether non-deterministically polynomial problems can be solved in polynomial time.  I am curious to know what makes this problem so difficult to prove/disprove.  Has there been any progress has been made toward resolving it.  That is, what approaches have been taken (and failed), and what insights have been made toward possibly finding a solution?</p>

CC BY-SA 3.0
2012-02-03T07:16:15.507Z
geometric complexity theory by Mulmuley is one of them..
singhsumit
CC BY-SA 3.0
2012-02-07T20:15:01.010Z
"I have not failed. I have just found ten thousand ways that won’t work." "How long will it take to find your shoes?"
Mooing Duck
<np-hardness><open-problem><np><proofs>
What progress has been made to prove whether or not p=np?
Paul
# What progress has been made to prove whether or not p=np?

(Asked by: username_0 on 2012-02-03)

I know that it is still one of the biggest mysteries of computer science whether non-deterministically polynomial problems can be solved in polynomial time. I am curious to know what makes this problem so difficult to prove/disprove. Has there been any progress has been made toward resolving it. That is, what approaches have been taken (and failed), and what insights have been made toward possibly finding a solution?

**Tags:** np-hardness, open-problem, np, proofs
> **Comments:**
> **username_1**: geometric complexity theory by Mulmuley is one of them..  
> **username_2**: "I have not failed. I have just found ten thousand ways that won’t work." "How long will it take to find your shoes?"  

---

## 2 answers

### Answer by username_3 on 2012-02-03. Score: 10

You might be interested in Scott Aaronson's talk "[Has There Been Progress on the P vs. NP Question?](http://www.scottaaronson.com/talks/pvsnpcsw.ppt)" ([earlier version](http://www.scottaaronson.com/talks/pvsnp.ppt))


---

### Answer by username_4 on 2012-02-03. Score: 5

For what concern "... what approaches have been taken and (in all probability) **failed** ...", see the [P-versus-NP Page](http://www.win.tue.nl/~gwoegi/P-versus-NP.htm) that collects links to papers/authors that try to settle the "P versus NP" question (in either way) :-)


---

