Kaisa_2012_3_photo by Veikko Somerpuro

Anmäl dig
14.8.2017 kl. 09:00 - 13.12.2017 kl. 23:59

Meddelande

Bild för Lauri Ylinen

Lauri Ylinen

Publicerad, 25.11.2017 kl. 19:32

TA's solutions to the exercises are now available also on course's Moodle page.

Tidsschema

I den här delen hittar du kursens tidsschema. Kontrollera eventuella andra tider i beskrivning.

DatumTidPlats
ons 6.9.2017
10:15 - 12:00
ons 13.9.2017
10:15 - 12:00
ons 20.9.2017
10:15 - 12:00
ons 27.9.2017
10:15 - 12:00
ons 4.10.2017
10:15 - 12:00
ons 11.10.2017
10:15 - 12:00
ons 18.10.2017
10:15 - 12:00
ons 1.11.2017
10:15 - 12:00
ons 8.11.2017
10:15 - 12:00
ons 15.11.2017
10:15 - 12:00
ons 22.11.2017
10:15 - 12:00
ons 29.11.2017
10:15 - 12:00
ons 13.12.2017
10:15 - 12:00

Övrig undervisning

06.09. - 18.10.2017 ons 10.15-12.00
01.11. - 29.11.2017 ons 10.15-12.00
13.12.2017 ons 10.15-12.00
Lauri Ylinen
Undervisningsspråk: Engelska

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