Then please go away until you have such a proof. I favour the latter as you clearly don’t understand what P or NP means; you are unable to provide a proof that your program is polynomial as claimed; I’m not even sure you know what polynomial time means or what a mathematical proof is. So, there is no problem of such few cases soon you shall have the mathematical proof. Therefore all P problems are NP.
That makes no sense. @MagiMaster, consistence theory is also needed such that any NP problem can be transformed into any of the NP-complete problems. It can handle a 31 element set and many more only if you follow the procedure.So, a 202 element set gives you 31milliseconds. Precise, the input does not follow the procedure.
How about you just link us to the news article about you winning the million. What really matter is that the problem was solved and if you don’t believe, come up with a computer program that does exactly or you may direct me to any computer program that does exactly? For the more challenging case you have been given, it fails.
Read the rest of this page »