The course is taught by Nicola Galesi and introduces students to basic and advanced results in Computational Complexity. Starting from basic topics as NP-completeness and the Hierarchy Theorems it arrives to handle the hardest recent results on the
AccediInfo Aggiuntive- Docente: NICOLA GALESI