In computational complexity theory, P, also known as PTIME or DTIME, is a fundamental complexity class. It contains all decision problems that can be solved by a deterministic Turing machine using a polynomial amount of computation time, or... Wikipedia