pockyD
Smash Legend
well...wait, did someone actually prove P = NP or were you making a very elaborate joke based on Adam's old username?
so, no. they "proved" P != NP... and it hasn't been officially verified yetapparently someone proved P != NP
hell if I understand the proofif the latter, then you have to explain it to me cuz in my data structures class they literally talked about NP problems for ONE day before the final and I was like half asleep that day
>.>
if you're asking about the problem, at the basest level, it's whether the class of problems where an answer can be verified 'easily' (in polynomial time) is equivalent to the class of problems that can be solved 'easily' (in polynomial time)
i'd recommend reading about it on wikipedia, as my knowledge about it isn't what it was 4 years ago