Question: is np a subset of p?
Answer: NP is the set of all problems that can be solved in polynomial time on a nondeterministic Turing machine (NDTM). Because deterministic TMs are a subset of NDTMs, P is a subset of NP. ... NP-complete is the class of problems which are both NP-hard and themselves members of NP.