Skip to main content

DD2542 Seminars on Theoretical Computer Science, Algorithms and Complexity 7.5 credits

This is an advanced course in algorithms and complexity within theoretical computer science with varying content. The course is given every second year (alternating with DD2445 Complexity Theory and DD2552 Seminars on Theoretical Computer Science, Programming Languages and Formal Methods). The general idea is to cover some area of active research in theoretical computer science. The seminars are often based on research or survey papers in that area, and/or on lecture notes from other advanced courses, since the material might be so recent that there are no good textbooks.

Choose semester and course offering

Choose semester and course offering to see information from the correct course syllabus and course offering.

Headings with content from the Course syllabus DD2542 (Autumn 2021–) are denoted with an asterisk ( )

Content and learning outcomes

Course contents

The course content may vary from course offering to course offering. Examples on topics are approximation algorithms, data mining, cryptography, parallel computations and probabilistic algorithms.

Intended learning outcomes

After passing the course, the student shall be able to

  • discuss advanced concepts within the area of the course
  • attack problems within the area of the course actively, both through own work and through search of relevant information
  • assimilate and present the essential contents of scientific articles within the area of the course.

Course disposition

No information inserted

Literature and preparations

Specific prerequisites

Completed course in algorithms and complexity equivalent to DD2350/DD2352.

Active participation in a course offering where the final examination is not yet reported in LADOK is considered equivalent to completion of the course.

Registering for a course is counted as active participation. The term 'final examination' encompasses both the regular examination and the first re-examination.

Recommended prerequisites

The course is open to anyone, but the main target audience are advanced Master's students and doctoral students in computer science and mathematics. 

Although the formal prerequisites are quite limited, course participants will need mathematical maturity and a willingness to learn new stuff. It should be noted that this will be a somewhat demanding course. (But hopefully even more fun!)


No information inserted


No information inserted

Examination and completion

If the course is discontinued, students may request to be examined during the following two academic years.

Grading scale

A, B, C, D, E, FX, F


  • ÖVN1 - Exercises, 7.5 credits, grading scale: A, B, C, D, E, FX, F

Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.

The examiner may apply another examination format when re-examining individual students.

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

No information inserted


No information inserted

Ethical approach

  • All members of a group are responsible for the group's work.
  • In any assessment, every student shall honestly disclose any help received and sources used.
  • In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.

Further information

Course web

Further information about the course can be found on the Course web at the link below. Information on the Course web will later be moved to this site.

Course web DD2542

Offered by

EECS/Computer Science

Main field of study

Computer Science and Engineering

Education cycle

Second cycle

Add-on studies

No information inserted


Johan Håstad (

Supplementary information

This course is usually given every second year (even years) in period 1. The language of tuition is English.

The course has replaced DD2442.