Algorithms - COMPLESSITÀ (2015/2016)

Course code
4S02709
Name of lecturer
Ferdinando Cicalese
Number of ECTS credits allocated
6
Academic sector
ING-INF/05 - INFORMATION PROCESSING SYSTEMS
Language of instruction
Italian
Location
VERONA
Period
II semestre dal Mar 1, 2016 al Jun 10, 2016.

To show the organization of the course that includes this module, follow this link * Course organization

Lesson timetable

II semestre
Day Time Type Place Note
Wednesday 11:30 AM - 1:30 PM lesson Lecture Hall I  
Thursday 11:30 AM - 1:30 PM lesson Lecture Hall I  
Friday 8:30 AM - 10:30 AM lesson Lecture Hall I  

Learning outcomes

The goal of this module is to introduce students to the main aspects of the computational complexity theory, and, in particular, to the NP-completeness theory and to the computational analysis of problems with respect to their approximability.

Recommended Prerequisites
-------------------------
To attend the course in a productive way, a student should be confident with the following topics:
1. Basic data structures as list, stack, queue, tree, heap.
2. Graph representation and fundamental graph algorithms:
2.1 Graph visit: BFS, DFS.
2.2 Topological ordering. Connected component.
2.3 Minimal spanning tree. Kruskal and Prim algorithm.
2.4 Single-source shortest path: Dijkstra algorithm and Bellman-Ford one.
2.5 All-pairs shortest path: Floyd-Warshall algorithm and Johnson one.
2.6 Max flow: Ford-Fulkerson algorithm.

A recommended book to revise the above topics is ``Introduction to Algorithms" di T. H. Cormen, C. E. Leiserson, R. L. Rivest e C. Stein (3 ed.).

Syllabus

Computational models, computational resources, efficient algorithms and tractable problems.

Relationships among computational problems. Polynomial reductions of one problem into another. The classes P, NP, co-NP. Notion of completeness. Proofs od NP-completeness: Cook's theorem; proofs of completeness using appropriate reductions. Search and Decision Problems. Self-Reducibility of NP-complete problems and existence of non-selfreducible problems. Recap of basic notions of computability: Turing Machines and Diagonalization. Hierarchy theorems for time complexity classes. Separability of classes and the existence of intermediate problem under the hypothesis the P is not equal NP.

Space Complexity. Models and fundamental difference between the use of time resource and the space resource. The space complexity classes NL and L and their relationship with the time complexity class P. The centrality of the reachability problem for the study of space complexity. Completeness for space complexity classes: Log-space reductions; NL-completeness of reachability. Non-determinism and space complexity. Savitch theorem and Immelmann-Szelepcsenyi theorem. The classes PSPACE and NPSPACE. Examples of reductions to prove PSPACE-completeness.

Introduction to the approximation algorithms for optimisation problems. Examples of approximation algorithms. Classification of problems with respect to their approximabuility. The classes APX, PTAS, FPTAS. Notion of inapproximability; the gap technique to prove inapproximability results; examples of approximation preserving reductions.

Introduction to the use of randomisation for solving hard problems. Classification of problems with respect to their solvability by means of polynomial randomized algorithms. The classes RP, ZPP, BPP and their relationships. Example of relationships between randomized complexity classes and the classes in the polynomial hierarchy.

Assessment methods and criteria

The examination consists of a written test. The grade in this module is worth 1/2 of the grade in the Algorithms examination.

STUDENT MODULE EVALUATION - 2015/2016