Theory of Computation
https://uvatoc.github.io/week11
25.1 Proving a Problem is in NP
- Recap: Class P and Class NP
- How can we prove LongestPath is in NP?
- Proof by describing Nondeterministic Turing Machine
- Proof by giving a Witness
David Evans and Nathan Brunelle
University of Virginia
