Algorithms & Complexity (Lecture)

Instructors: Evanthia Papadopoulou

Academic Programs: Master of Science in Informatics

Workload: 6 ECTS

Description

Algorithms are fundamental to computer science. They are the essence of computer programs lying at the core of any software system. This course covers fundamental techniques for designing computer algorithms, proving their correctness, and analyzing their running times. The contents include greedy algorithms, divide and conquer algorithms, dynamic programming, network flow algorithms, NP completeness and computational intractability, approximation algorithms, and randomized algorithms.

 
Area
Theory and Algorithms

Find out what can and cannot be computed, and how to compute it. More...

 
Gold sponsors:
Silver sponsor:
Con la collaborazione di: