NEWSFLASH! Meami.org finds: As it turns out P.NP-complete problems are a set of problems which any other NP-problem can be reduced to in polynomial time, but which retain the ability to have their solution verified
in [Math]
|
Prev: Wikipedia Accepts Meami.org's Gibraltar code product
Next: Minimum distribution from two seperate distributions
From: sci.math on 6 Jul 2010 17:01 NEWSFLASH! Meami.org EXCLUSIVE UPDATE finds: As it turns out P.NP- complete problems are a set of problems which any other NP-problem can be reduced to in polynomial time, but which retain the ability to have their solution verified in polynomial time. http://meami.org/gibraltar.htm
From: porky_pig_jr on 6 Jul 2010 17:17
On Jul 6, 5:01 pm, "sci.math" <marty.musa...(a)gmail.com> wrote: > NEWSFLASH! Meami.org EXCLUSIVE UPDATE finds: As it turns out P.NP- > complete problems are a set of problems which any other NP-problem can > be reduced to in polynomial time, but which retain the ability to have > their solution verified in polynomial time.http://meami.org/gibraltar.htm To Pee or To Not Pee: this is the question. |