ConceptTheory & Algos
3COLOR in NP
The graph 3-coloring problem is in NP, demonstrated by a verifier that checks a proposed 3-coloring in polynomial time.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Graph coloring1NP verifiers1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.