Credit Hours: 3Reviews problems, algorithms, Turing machines and computability. Studies Boolean and first-order logic, leading to undecidability results; and relations among complexity classes using reductions and completeness. Presents approximate and randomized algorithms. Prerequisite: CSE 5210, CSE 5211
