This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Lesson 1899 of 2,872·43. Complexity TheoryPro lesson
The Class P: Polynomial Time
Define P as the set of decision problems solvable by deterministic algorithms in polynomial time.