In computational complexity theory, the complexity class "P" (Polynomial time) is considered the class of tractable problems, meaning problems that can be solved by an algorithm with a running time that is polynomial in the size of the input, making them considered "efficiently solvable" in practice. --Gemini
List of complexity classes: https://en.wikipedia.org/wiki/Time_complexity
