Gå till denna sida på svenska webben

Algorithms and Complexity

  • 7.5 credits

You will learn to develop and implement algorithms and analyze them with respect to correctness and efficiency; define the concepts P, NP, NP-completeness, and undecidability, etc, to be able to identify and attack problems that are unrealistically resource demanding or not possible to solve, and to construct computer programs that use time and memory efficiently.

Further course information will appear soon on this page. Until then, information can be found on the department website.

Know what you want to study?

Find your study programme

What can I study?

Explore our subjects