@openstem shared this flashcard
Software · L5 · Complexity Theory
P vs NP, NP-completeness, polynomial-time reductions, Cook–Levin theorem, and approximation algorithms.
Software
Updated 0
0
We use privacy-friendly product analytics (no session recording, PII masked) to improve OpenStem. Load analytics? Privacy Policy