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

Alternative NP Definition: Nondeterministic TMs

Characterize NP using nondeterministic Turing machines that accept in polynomial time.

This lesson is for subscribers

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