Course contentsShow
Computer Science
Lesson 1889 of 2,87243. Complexity TheoryPro lesson

The Class P (Polynomial Time)

Defining problems solvable in polynomial time and understanding why P represents efficiently solvable problems.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.