177KiB, 1000x1000, 1302902099759.jpg View SameGoogleiqdbSauceNAO Anonymous Fri 07 Feb 20:22:51 2020 No.11367202 ViewReplyOriginalReport Quoted By: >>11367247 >>11367248 >>11367256 If it's proven that P =/= NP, does that mean there's no polynomial time algorithm for Travelling Salesperson and other hard-NP problems?