# Polynomial time is a subset of NP-complete

Last edited: 2023-11-11

# Statement

Lemma

The class of Polynomial time problems is a subset of Nondeterministic Polynomial time (NP) .

# Proof

If the problem is in NP then we already know the problem is a search problem . Therefore it is in the class Nondeterministic Polynomial time .