Course page (Computational Complexity @ DI 2022/2023)

Computational complexity studies the intractability and the inherent complexity of computational problems. Some problems have efficient algorithms and solutions, while some others seem not to have any. In this course for the students of Dept. of Computer Science we study several computational model in which we can say interesting things about problems, in order to characterize their hardness. We discuss the famouse P vs NP problem.

Course page (Informatica@DSS 2022/2023 - 2o canale)

This is an introductory course to computer science and programming for part of the students of Dept. of Statistical Science. The course introduces basic concepts of computer science, programming in Python, algorithms and complexity.

• 2021-2022 — Progettazione degli Algoritmi 2021/2022 - 1o canale
• 2021-2022 — Informatica@DSS 2021/2022 - 2o canale
• 2020-2021 — Informatica@DSS 2020/2021 - 2o e 3o canale
• 2019-2020 — Informatica@DSS 2019/2020 - 2o canale
• 2018-2019 — Informatica@SEFA 2018/2019
• 2017-2018 — Informatica@SEFA 2017/2018
• Fall 2015 (TokyoTech, Japan) — Introduction to Proof Complexity
• Spring 2014 (KTH, Sweden) — SOS and integer programming relaxations
• Fall 2012 (KTH, Sweden) — Communication Complexity (Co-Lectured)