note
jynx
<br>
An NP problem is a programming problem that can only be
solved by the theoretical nondeterministic Turing machine
(NP stands for Nondeterministic Polynomial). An NP-Complete problem has the property that if you can find a polynomial running time solution to this problem than you can find a polynomial solution to all other NP problems as well. Unfortunately, that works both ways, if you prove that there is <b>no</b> polynomial solution to the problem than all other NP problems don't have a polynomial runtime as well.<p>
For more information, look [http://foldoc.doc.ic.ac.uk/foldoc/foldoc.cgi?NP-complete|here].<p>
Hope This Helps,<br>
jynx<p>
<b>Update</b>: D'oh! Beaten by [MeowChow]...
80272
80358