Question: Does anyone know what the Millennial Institute's standards are to consider the P vs. NP problem solved? Namely, if one were to find a solution to the particular problem of subset sums in polynomial time, but one didn't know how this solution could be mapped onto other NP-complete problems, would the Institute consider the problem solved, since presumably (though I'm not sure if this is true) a polynomial solution to any NP-complete problem can be translated into a polynomial solution to all the others? What I mean is: if I knew enough about number theory and combinatorics to prove that the subset sum problem can be solved in a polynomial number of steps, but didn't know jack about computation theory or algorithms, would that suffice? Or would I have to master and include the algorithmic language necessary in a submitted paper for the Institute to even take me seriously? Or is it even possible for there to be a solution to one NP-complete problem that is not translatable to the others?