ConceptTheory & Algos
3-Colorability as NP
Proving that 3-coloring is in NP by providing a non-deterministic polynomial time algorithm that branches to test all colorings.
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.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.