class P problems

class P problems

[′klas ′pē ‚präb·ləmz]
(computer science)
Problems that can be solved in polynomial time on a conventional sequential computer.