information:highlighting, stylistic:style_transfer
P

All problems in P, denoted P ⊆ N P {\displaystyle {\mathsf {P\subseteq NP}}}. Given a certificate for a problem in P, we can ignore the certificate and just solve the problem in polynomial time.