Complexity Class Hierarchy
P ⊆ NP ⊆ PSPACE ⊆ EXPTIME, with NP-hard / NP-complete shown.
Rendering…
Make it your own.
digraph cc {
rankdir=BT;
graph [bgcolor=transparent];
node [shape=box, style="rounded,filled", fontname=Inter, fontsize=11];
P [label="P", fillcolor="#dcfce7"];
NP [label="NP", fillcolor="#dbeafe"];
NPC [label="NP-complete\n(NP ∩ NP-hard)", fillcolor="#fef3c7"];
NPH [label="NP-hard", fillcolor="#fee2e2"];
PSP [label="PSPACE", fillcolor="#fce7f3"];
EXP [label="EXPTIME", fillcolor="#ede9fe"];
P -> NP -> PSP -> EXP;
NPC -> NP [arrowhead=none];
NPC -> NPH [arrowhead=none];
NPH -> EXP [style=dashed];
}