P

The P in the P class stands for Polynomial Time. It is the collection of decision problems(problems with a “yes” or “no” answer) that can be solved by a deterministic machine in polynomial time.

Visit the following resources to learn more:

• @article@Trying to understand P vs NP vs NP Complete vs NP Hard
• @video@Complexity: P, NP, NP-completeness, Reductions
• @video@Complexity: Approximation Algorithms
• @video@Complexity: Fixed-Parameter Algorithms
• @video@Lecture 23: Computational Complexity
• @video@Greedy Algs. II & Intro to NP Completeness