P (Polynomial Time - PTIME) a type of complexity class that is the set of all decision problems that can be solved by a deterministic Turing machine using a polynomialamount of time Resources https://en.wikipedia.org/wiki/P_(complexity)