Shared flowchart

Software · L5 · Complexity Class Hierarchy

Sign in to clone

Containment relationships between P, NP, co-NP, NP-complete, PSPACE, and EXPTIME under the conjecture P ≠ NP.

by @openstemUpdated Software
P: deterministic poly-timeNP: poly-time verifiableco-NP: complements of NP problemsNP-complete: hardest in NPPSPACE: poly-spaceEXPTIME: exponential timeP=NP? (open)

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