Class P

Last updated Jun 23, 2022

• Type atom
• Status needs revision

Class P, which stands for Polynomial-Time, contains those problems that can be solved efficiently (in polynomial time) by classical computer.

Some problems in Class P are:

• Matchmaking in the " Stable Marriage problem".
• Determining if a number is prime.
• Linear programming.

• Chapter 1 - Classical Information and Computation > ^115dd2
• Chapter 1 - Classical Information and Computation > ^be6bfa