Algorithms and Complexity

Log in to your course web

You are not logged in KTH, so we cannot customize the content.

This course provides an introduction to theoretical computer science, which is a strong area of ​​research at the School of Computer Science and Communication. You will encounter some of our research results in the course.

You will learn about algorithm design and get to see some pretty complicated, but very useful algorithms. The complexity part of the course deals with how to investigate which problems can be solved efficiently with the help of computer, which ones will take an unreasonably long time, and which ones cannot be solved by a computer at all.

Problems that are too difficult to solve exactly can sometimes be solved approximately. You will see examples of some approximation algorithms and some problems that are so hard that they can not even be approximated in a reasonable time.

Details for the course are in Canvas:


Feedback News