Course development and history
Integer programming relaxation hierarchies.
The sum of squares system.
Algorithms employing such relaxations.
Lower bounds for sums of squares.
On completion of the course, the students should be able to
Lectures and written assignments.
Knowledge in theoretical computer science corresponding to DD1352 Algorithms, data structures and complexity or DD2352 Algorithms and complexity is required.
No information inserted
See description on the course web.
If the course is discontinued, students may request to be examined during the following two academic years.
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.
Pass the problem sets and lecture notes.
EECS/Theoretical Computer Science