P
← Back to Complexity Classes
The class of decision problems that can be solved by a deterministic Turing machine in polynomial time. Problems in P are considered efficiently solvable and tractable.
Key Properties
Related
- NP (P is a subset of NP)
- P vs NP Problem (are P and NP the same?)