Shared flashcard

Software · L5 · Complexity Theory

Sign in to clone

P vs NP, NP-completeness, polynomial-time reductions, Cook–Levin theorem, and approximation algorithms.

by @openstemUpdated Software

We use privacy-friendly product analytics (no session recording, PII masked) to improve OpenStem. Load analytics? Privacy Policy