Loading Discussion on answer by jmite: Assuming P = NP, how would one solve the graph coloring problem in polynomial time?
Just a second…

load older messages full transcript highlights

	You must be logged in to talk. See the faq for more information.
		help \| faq \| legal \| privacy policy \| mobile

all rooms

site rooms

Discussion on answer by jmite: Assuming P = NP, how would one solve the graph coloring problem in polynomial time?

Imported from a comment discussion on cs.stackexchange.com/questions/121710/…

Welcome to the chat! Unfortunately, you have JavaScript disabled, and thus this chat will not work. If you would like to participate, please enable JavaScript in your browser and reload this page.

New feed items

Discussion on answer by jmite: Assuming P = NP, how would one solve the graph coloring problem in polynomial time?