Shared note

Software · L5 · NP-Completeness and Reductions

Sign in to clone

Formal definitions of NP-hardness and NP-completeness, the reduction method, and landmark complete problems.

by @openstemUpdated Software

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