P vs NP

• Definition: P is the class of decision problems that are solvable by a polynomial time algorithm.

• Every problem in P is also in NP

• Famous Open Question:

Previous slide

Next slide

Back to first slide

View graphic version