Why is NP and NP-complete so easy to understand, but so difficult to truly grasp the concept. I'm glad they are teaching it and all, but this subject is still being debated.
There is literally a million dollar bounty out to anybody that can devise an algorithm to solve an NP-Complete problem in polynomial time, because then, it would prove that NP problems can not only be verified in polynomial time, but also, that NP problems can be solved in a polynomial time, thus, allowing NP = P, because NP-complete problems are a sub-version of an NP problem, and the difference between NP and P problems is that P class problems can be solved in Polynomial time.
anyways. Ask me shit while I work this out.
Be it about asking about more of this math shit, Anon, Not Anon, questioning, or just conversational.
