15453 Formal Languages, Automata, and Computation
Lecture 31: The Class NP
We show that the class NP can be defined in two equivalent ways:
via nondeterministic Turing machines or via a polynomialtime
verifier. We then examine further problems which lie in the
class NP, such as CLIQUE and SUBSETSUM.
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
