In essence, the question NP = P? asks: if 'yes'-answers to a 'yes'-or-'no'-question can be verified "quickly" (in polynomial time), can the answers themselves also be computed quickly?
Consider, for instance, the subset-sum problem, an example of a problem which is "easy" to verify, but whose answer is believed (but not proven) to be "difficult" to compute. Given a set of integers, does some nonempty subset of them sum to 0? For instance, does a subset of the set {−2, −3, 15, 14, 7, −10} add up to 0? The answer "yes, because {−2, −3, −10, 15} add up to zero", can be quickly verified with a few additions. However, finding such a subset in the first place could take much longer. The information needed to verify a positive answer is also called a certificate. Given the right certificates, "yes" answers to our problem can be verified in polynomial time, so this problem is in NP.
Actions
Gameplay Stats
Member since:
October 9, 2004 Steam Rating:
10 Playing time:
60.4 hrs past 2 weeks Friends
Kog
In-Game
Dragon Age: Origins
mr. fluffynutters the squirrel
In-Game
Left 4 Dead - Join
Pappy(|S|)
In-Game
Team Fortress 2 - Join
« vVv » ◊мεятค
Online
Friends since May 22, 2009
Steam Profile
Downtown1
Profile _
United States 
No information given.
Comments _
You must be logged on to add comments.
There are no comments on this account.
Groups _
No Parking



