Algoritmer och komplexitet
Här på Kurswebben finns generell kursinformation som ska vara öppen för alla.
I Canvas finns kursmaterial etc. per kursomgång som du har tillgång till om du är lärare eller registrerad student på den aktuella kursomgången. Hitta dit från Personliga menyn via länk under kursen, exempel: HT17-1
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. Complexity part of the course deals with how to investigate which problems can besolved ( in reasonable time ) with the help of computer , which ones will take an unreasonably long time and which can not 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.
The course is sort of a smaller variant of the course DD1352.
The course on Canvas: algokomp18