deterministic and nondeterministic computation and their relationships, the P versus NP problem and hard problems for NP and beyond. This course fulfills the Theory Breadth requirement. NOTE: This ...

Kozen. Automata Theory, Languages, and Computation , Hopcroft, Motwani, and Ullman (3rd edition). Elements of the theory of computation, Lewis and Papadimitriou (2nd edition). Online notes and ...