Cart (0)Free Online Dictionary
P (complexity)
| Wikipedia English The Free Encyclopedia |  Download this dictionary |
P (complexity)
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is one of the most fundamental complexity classes. It contains all decision problems which can be solved by a deterministic Turing machine using a polynomial amount of computation time, or polynomial time.
| See more at Wikipedia.org... |
© This article uses material from Wikipedia® and is licensed under the GNU Free Documentation License and under the Creative Commons Attribution-ShareAlike License
| P (complexity) in German | P (complexity) in Russian | P (complexity) in Korean | P (complexity) in Turkish | P (complexity) in Hebrew | P (complexity) in Polish | P (complexity) in Finnish
You think you have ethics...
Take the survey NOW!