Algorithms and Complexity
A.Y. 2024/2025
Learning objectives
This course aims at raising students' awareness on the role of approximation algorithms and on the impact of randomness on designing efficient algorithms
Expected learning outcomes
The student should be able to design and study algorithms using the techniques described during the course
Lesson period: First semester
Assessment methods: Esame
Assessment result: voto verbalizzato in trentesimi
Single course
This course cannot be attended as a single course. Please check our list of single courses to find the ones available for enrolment.
Course syllabus and organization
Single session
Responsible
Lesson period
First semester
INF/01 - INFORMATICS - University credits: 6
Lessons: 48 hours
Professor:
Boldi Paolo
Shifts:
Turno
Professor:
Boldi PaoloProfessor(s)