No.11367202 ViewReplyOriginalReport
If it's proven that P =/= NP, does that mean there's no polynomial time algorithm for Travelling Salesperson and other hard-NP problems?