Why can there be no reductions from NP-complete problems to P problems under P NP? (2 Solutions!!)
Channel: Roel Van de Paar
Date: 2021-02-13

Why can there be no reductions from NP-complete problems to P problems under P NP?

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 Raphael (cs.stackexchange.com/users/98), user Nyfiken Gul (cs.stackexchange.com/users/65232), user David Richerby (cs.stackexchange.com/users/9550), user 6005 (cs.stackexchange.com/users/24088), and the Stack Exchange Network (cs.stackexchange.com/questions/73844). 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