Course development and history
The sum-of-squares hierarchy, algorithms that can be formalised by the sum-of-squares hierarchy and lower bounds for the sum-of-squares hierarchy
After passing the course, the students should be able to:
- explain the fundamental ideas behind the sum-of-squares hierarchy
- apply the sum-of-squares hierarchy on small problem instances
- account for the most important results about the sum-of-squares hierarchy
- account for current research about the sum-of-squares hierarchy and the large open problems at a general level.
No information inserted
Lecture notes and research articles about the sum-of-squares hierarchy.
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.
Home assignments and presentation of research article.
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.
EECS/Theoretical Computer Science