123KiB, 1533x961, maxresdefault.jpg View SameGoogleiqdbSauceNAO P=NP Anonymous Sun 26 Nov 04:15:53 2017 No.9321947 ViewReplyOriginalReport Quoted By: If you have a polynomial time verification algorithm for an NP-complete problem why dont you just run that algorithm backwards (starting from "TRUE")?