What is the implication of the sentence: "if any NP complete problem is p time solvable, then...
Channel: Roel Van de Paar
Date: 2021-02-12

Computer Science: What is the implication of the sentence: "if any NP complete problem is p time solvable, then all problems in NP are p time solvable"

Helpful?  Please support me on Patreon: https://www.patreon.com/roelvandepaar

With thanks & praise to God, and with thanks to the many people who have made this project possible! | Content (except music & images) licensed under CC BY-SA https://meta.stackexchange.com/help/licensing | Music: https://www.bensound.com/licensing | Images: https://stocksnap.io/license & others | With thanks to user Yuval Filmus (cs.stackexchange.com/users/683), user Raphael (cs.stackexchange.com/users/98), user Bajie (cs.stackexchange.com/users/20559), and the Stack Exchange Network (cs.stackexchange.com/questions/33754). Trademarks are property of their respective owners. Disclaimer: All information is provided "AS IS" without warranty of any kind. You are responsible for your own actions. Please contact me if anything is amiss at Roel D.OT VandePaar A.T gmail.com