Understanding P and NP in Complexity Theory

In this video, we learn that all decision problems that can be solved in polynomial time are in the complexity class P. And all decision problems that can be verified in polynomial time are in NP. On top of that we discuss an important technique known as polynomial reduction: We say that problem A is less or equal to problem B if we can use B to solve A.