Thank you. That is a wonderful description of what the P vs NP problem is all about.
Re:P versus NP Explained
by danielrm26 on Monday February 03, 2014 @10:33AM
(#7171096)
Can I use that?
By all means.
Re:P versus NP Explained
by danielrm26 on Monday February 03, 2014 @10:49AM
(#7171202)
Updated. Thanks for the input.
I don't think it would be difficult to say something like:
> P and NP are two different kinds of problems. P problems are easy for computers to solve, and NP problems are easy for computers to check answers for. All P problems are NP problems; that is, if it's easy for the computer to solve, it's easy to verify the solution. The P vs NP problem asks: within the class of NP problems, are there problems which are not P, that is, which are not easy for computers to solve?