Kaisa_2012_3_photo by Veikko Somerpuro

Enrol
12.8.2019 at 09:00 - 13.12.2019 at 23:59

Timetable

Here is the course’s teaching schedule. Check the description for possible other schedules.

DateTimeLocation
Fri 6.9.2019
14:15 - 16:00
Fri 13.9.2019
14:15 - 16:00
Fri 20.9.2019
14:15 - 16:00
Fri 27.9.2019
14:15 - 16:00
Fri 4.10.2019
14:15 - 16:00
Fri 11.10.2019
14:15 - 16:00
Fri 18.10.2019
14:15 - 16:00
Fri 1.11.2019
14:15 - 16:00
Fri 8.11.2019
14:15 - 16:00
Fri 15.11.2019
14:15 - 16:00
Fri 22.11.2019
14:15 - 16:00
Fri 29.11.2019
14:15 - 16:00

Other teaching

06.09. - 18.10.2019 Fri 14.15-16.00
01.11. - 29.11.2019 Fri 14.15-16.00
Åsa Hirvonen
Teaching language: English

Description

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