ConceptTheory & Algos
Importance of NP-completeness
Showing a problem is NP-complete provides evidence of computational intractability and gives a good candidate for proving P differs from NP.
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
3The lectures that define it or assume it, and the concepts next to it.