The diagram below describes inclusion relations between the time complexity of algorithms

stateDiagram

	NPHARD : NP-Hard
	NPCOMPLETE : NP-Complete

	NPCOMPLETE --> NPHARD
	NPCOMPLETE --> NP
	P --> NP

Relevant groups include: