ConceptTheory & Algos
Brute force algorithm for NP
An algorithm that enumerates exponentially many candidate solutions and checks each in polynomial time to see if it is a genuine solution.
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.