[2024-02-19]
The text and solution outline of the 2024-02-19 exam is available in the Exams section.
[2024-01-17]
The text and solution outline of the 2024-01-08 exam is available in the Exams section.
Last edition: Fall semester 2023, four hours per week.
Mauro Brunato < mauro.brunato@unitn.it>
Please email me if you want to set up a meeting.
In order to receive urgent updates (e.g., about moved or cancelled lectures), please subscribe to the course's Moodle page.
The course sets the theoretical bases for being able to discuss two fundamental properties of computational problems.
Given a problem, we will initially be concerned about its computability:
When a problem is found out to be solvable, we can wonder how efficiently it can be done.
Basic notions of mathematical logic
At the end of the course, the students will be able to:
For the actual program, see below.
The following books may be useful, but none is mandatory. References to online material will be provided in the course program section.
Computational Complexity: A Modern Approach. Cambridge University Press, 2009. ISBN 9780521424264 [Draft of the book]
and .Introduction to Automata Theory, Languages and Computation. Pearson new International Edition, 2013. ISBN: 9781292039053
, , and .Computational complexity. Addison Wesley (Pearson College Div.), 1994. ISBN 9780020153085
.
This section contains course material and exercises.
(See the lecture notes for details)
The exam consists of a written test, with exercises and theoretical questions. Examples are provided in the lecture notes.