Skip to main content

DD2442 Seminars on Theoretical Computer Science 7.5 credits

This is an advanced course in theoretical computer science with varying content which is given every second year (alternating with DD2445 Complexity Theory).

The general idea is to cover some area of active research in theoretical computer science. Lectures 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 yet.

Course offerings are missing for current or upcoming semesters.
Headings with content from the Course syllabus DD2442 (Autumn 2021–) are denoted with an asterisk ( )

Content and learning outcomes

Course contents

The contents of the course may vary from one year to another. Example on topics is approximation algorithms, data mining, cryptography, parallel computations and probabilistic algorithms.

Intended learning outcomes

On completion of the course, a student should be able to: discuss advanced concepts within the field of the course, attack problems within the area of the course actively, both through own work and through search of relevant information, profit by the essential contents of scientific articles within the area of the course.

Course disposition

No information inserted

Literature and preparations

Specific prerequisites

May vary from one year to another, but knowledge equivalent to one of the courses DD1352 Algorithms, data structures and complexity and DD2352 Algorithms and complexity will always be required. The course co-ordinator can give more instructions.

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.

Other requirements for final grade

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

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

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 DD2442

Offered by

Main field of study

Computer Science and Engineering

Education cycle

Second cycle

Add-on studies

No information inserted


Johan Håstad e-post:

Transitional regulations

A student who has not passed the course should take the assessment in the course DD2542 instead.

Supplementary information

This course has been replaced by DD2542 from 2022/2023.