Instructor: Prof. Rosario Gennaro
Tuesday and Thursday, 11-12:15, NA 6311
This class will cover an introduction to hard computational problems, those for which we do not know how to compute a solution with feasible amount of resources. Topics will include: computational models, NP-completeness, approximations of hard problems, and the foundations of modern cryptography.