[Reach]

Ah, P=NP

Firstly, noone has even shown that it is possible or impossible to solve (in polynomial time). So, it seems wasteful that one might spend time on it if it isn't actually solvable. P might not = NP. Though, if you could prove P didn't equal NP you could probably get the prize as well.


You're going to have to develop a new algorithm in order to solve it. No current method gives any type of real solution. It requires the use of superpolynomial time (imperfect solution).