P
P
In computational complexity theory, P, also known as PTIME or DTIME, is one of the most fundamental complexity classes. It contains all decision problems that can be solved by a deterministic Turing machine using a polynomial amount of computation time, or polynomial time.The above text is a snippet from Wikipedia: P (complexity)
and as such is available under the Creative Commons Attribution/Share-Alike License.