Kaisa_2012_3_photo by Veikko Somerpuro
Complexity theory
This course is an introduction to computational complexity. During the course you will learn how computational problems are categorised into complexity classes and how hardness of problems is compared. You will also learn basic complexity classes and techniques for proving complexity results.
After the course you will not only know what the P vs NP problem is all about, you will also have a deeper understanding of how it is related to other complexity questions, as well as of what limitations common proof techniques have in tackling it.
Meddelande
Tidsschema
Material
We follow approximately chapters 1-5 of the book Arora, S., Barak, B. Computational Complexity: A Modern Approach. A draft of the book is available on the authors' page http://theory.cs.princeton.edu/complexity/
Another good text is
C. H. Papadimitriou: Computational complexity (1994)
Uppgifterna
Exercises
Kursbeskrivningen
The course is evaluated based on a final exam and the exercises the student solved during the course.
The course exam will be organized in the December general exam of the department (11.12. at 16-19). A second possibility is offered in the January general exam. Please note that you need to sign up for the exam separately.
Beskrivning
Optional course.
Master's Programme in Mathematics and Statistics is responsible for the course.
The course belongs to the Mathematics and Applied mathematics module.
The course is available to students from other degree programmes.
Routine in mathematics
Master studies
The course is an introductory course to computational complexity theory.
Recommended time/stage of studies for completion: 1. or 2. year
Term/teaching period when the course will be offered: varying
Turing machines, basic complexity classes, hierarchy theorems, reductions and completeness
C. H. Papadimitriou: Computational complexity (1994); S. Arora and B. Barak: Computational complexity: a modern approach (2009)
Lectures and exercise classes
Exam and excercises, Course will be graded with grades 1-5
Exam, other methods will be described later