ConceptTheory & Algos
Self-reducibility
A problem is self-reducible if it can be reduced to itself on shorter instances, allowing search problems to be solved using decision algorithms.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.