23 reputation
4
bio website
location
age
visits member for 1 year, 8 months
seen Sep 22 '13 at 21:28

Dec
17
awarded  Editor
Dec
17
awarded  Scholar
Dec
17
accepted show that careful 5COLOR is in NP
Dec
17
awarded  Supporter
Dec
17
comment show that careful 5COLOR is in NP
Thanks for your answering. If I understand it right, what you said is that NTM can construct and check a coloring in polynomial time, so that this must be a NP problem, right? FYI: What I want to ask is just whether this is a NP problem or not.
Dec
17
asked show that careful 5COLOR is in NP
Nov
14
awarded  Student
Nov
14
asked unique maxflow problem