P (complexity)

Class of problems solvable in polynomial time From Wikipedia, the free encyclopedia