# 2022-2023 (1o Sem.) Computational Complexity

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.