If an NP-complete problem is shown to have a non-polynomial lower bound, would that prove that P...
Channel: Roel Van de Paar
Date: 2021-02-09

Computer Science: If an NP-complete problem is shown to have a non-polynomial lower bound, would that prove that 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 Luke Mathieson (cs.stackexchange.com/users/1636), user haydnv (cs.stackexchange.com/users/37625), user D.W. (cs.stackexchange.com/users/755), and the Stack Exchange Network (cs.stackexchange.com/questions/45417). 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