FDD3013 Sum of Squares and Integer Programming Relaxations 6.0 credits

Summan av kvadrater och heltalsprogrammeringslättnader

Offering and execution

Course offering missing for current semester as well as for previous and coming semesters

Course information

Content and learning outcomes

Course contents *

Integer programming relaxation hierarchies.

The sum of squares system.

Algorithms employing such relaxations.

Lower bounds for sums of squares.

Intended learning outcomes *

On completion of the course, the students should be able to

  • read conference papers within the field of the course
  • present linear and positive semi-definite relaxations of linear programs and how these can be used in approximation algorithms
  • show lower borders for the sum of squares system and present the limitations of the method.

Course Disposition

Lectures and written assignments.

Literature and preparations

Specific prerequisites *

Knowledge in theoretical computer science corresponding to DD1352 Algorithms, data structures and complexity or DD2352 Algorithms and complexity is required.

Recommended prerequisites

No information inserted


No information inserted


See description on the course web.

Examination and completion

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

Grading scale *

P, F

Examination *

    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 *

    Pass the problem sets and lecture notes.

    Opportunity to complete the requirements via supplementary examination

    No information inserted

    Opportunity to raise an approved grade via renewed examination

    No information inserted


    Jakob Nordström

    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

    No information inserted

    Offered by

    EECS/Theoretical Computer Science

    Main field of study *

    No information inserted

    Education cycle *

    Third cycle

    Add-on studies

    No information inserted

    Postgraduate course

    Postgraduate courses at EECS/Theoretical Computer Science