Google
 
Web unafbapune.blogspot.com

Saturday, February 16, 2013

 

P vs NP

P = NP would mean every computational problem can be solved in polynomial time.
P \(\ne\) NP would mean no NP-complete problems could be solved in polynomial time.
There are NP-complete problems that are "easier" to solve in practice than others.
The ability to solve some instances of an NP-complete problem implies P = NP.
Showing a problem is NP-complete means it can't be solved in polynomial.

Which one(s) of the above are true ?

See Problem Set 2 at Intro to Theoretical Computer Science.


Comments: Post a Comment

<< Home

This page is powered by Blogger. Isn't yours?