Understanding NP in Computation Theory 🖥️
Explore the basics of NP, nondeterministic machines, and the power behind this complexity class in computation theory.
David Evans
599 views • Nov 3, 2020
About this video
Theory of Computation
https://uvatoc.github.io/week11
24.3 Complexity Class NP
- Informal Notion of Class NP
- Nondeterministic Machines
- "Power" of Machines
- (review) NFAs are equivalent in power to DFAs
- Are things different for TMs? (answered in next segment)
Nathan Brunelle and David Evans
University of Virginia
https://uvatoc.github.io/week11
24.3 Complexity Class NP
- Informal Notion of Class NP
- Nondeterministic Machines
- "Power" of Machines
- (review) NFAs are equivalent in power to DFAs
- Are things different for TMs? (answered in next segment)
Nathan Brunelle and David Evans
University of Virginia
Video Information
Views
599
Likes
5
Duration
13:08
Published
Nov 3, 2020
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.