> Pause. This doesn't make sense. If you have a polynomial algorithm then it's in P. If you've reduced HC to MSP then you've already shown MSP is NP-Hard.

This actually makes sense, although it wouldn't be necessary to point out.

If the author proves that P=NP, then all problems in P are NP-complete (because every problem in P is reducible to any non-trivial problem in P).

The paper doesn't look very promising to me, but the basic logic of the argument makes sense.