 Polynomial-time problems

Polynomial-time problems are a class of decision problems in computational complexity theory that can be solved by an algorithm in polynomial time, which means that the time taken to solve the problem is proportional to a polynomial function of the size of the input.