Does P = NP? 43  If we could find an efficient (i.e. polynomial) time solution to any NP- complete problem  Then we could, through a polynomial-time
{"Image DocumentName": "Does P = NP?If we could find an efficient (i.e. polynomial) time solution to any NP- complete problem.", "Image ImageDescription": "Then we could, through a polynomial-time reduction, find an efficient (i.e. polynomial) solution to all NP-complete problems. That\u2019s what the -complete part means.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}