algorithms
Polynomial versus exponential
taught
Taught in
-
Polynomial versus exponential
Discrete Mathematics I — Logic, Proof, and Structure
-
P vs. NP, informally
Graph Theory
Requires
- common-complexity-classes required
Required by
- Comparing algorithms required
- NP-complete graph problems required
Local knowledge map
Local knowledge map
Click to expand
Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.