Definition: The complexity class of languages that can be accepted by a deterministic Turing machine in polynomial time.
See also NP, BPP.
Note: From Algorithms and Theory of Computation Handbook, page 24-19, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
History, definitions, examples, etc. given in Comp.Theory FAQ, scroll down to P vs. NP. Wikipedia entry on Complexity classes P and NP.
Scott Aaronson's Complexity Zoo
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 11 February 2019.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "P", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 11 February 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/p.html