1:25:25

16. Complexity: P, NP, NP-completeness, Reductions

49:47

Problem Solving: NP-Hard/NPC/Decidable/Undecidable

38:21

Binary Search

41:23

Reductions

1:21:08

17. Complexity: Approximation Algorithms

45:47

R8. NP-Complete Problems

19:43

Matthew Reinhard - Computing the Trispectrum in Axion Inflation: Reduction to Low-D Integrals

57:35

Examples of Language Transformations, PDA Constructions, and Classification Techniques (MT1 Review)