Assuming P = NP, how would one solve the graph coloring problem in polynomial time?
Channel: Roel Van de Paar
Date: 06/02/2021

Computer Science: Assuming P = NP, how would one solve the graph coloring problem in polynomial time?

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 TheSimpliFire (cs.stackexchange.com/users/91835), user John Doe (cs.stackexchange.com/users/127350), user jmite (cs.stackexchange.com/users/2253), user Jirka Hanika (cs.stackexchange.com/users/26267), user gnasher729 (cs.stackexchange.com/users/17408), user Especially Lime (cs.stackexchange.com/users/63167), user donkey (cs.stackexchange.com/users/87229), and the Stack Exchange Network (cs.stackexchange.com/questions/121710). 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