MATE5290 Algorithmic complexity 10 ECTS
Organised by
Mathematics
Person in charge
Department of Mathematics and Statistics, Juhani Karhumäki
Preceding studies
Recommended:
Basics on algorithms, in particular algorithmic thinking. Automata theory course is recommended.

Learning outcomes

to understand basic concepts and methods in algebraic complexity; to be able to reduce problems to each other, both decidable and undecidable ones

Contents

The complexity theory of algorithms has been developed over the past 40 years or so. It culminates the celebrated P=NP problem. This problem asks whether many natural algorithmic problems, like the factorization of composite numbers, can be solved by a polynomial time algorithm. In the course basic properties of complexity classes are presented. In particular, the existence of so-called NP-complete problems are shown, and natural examples of those are given. Also undecidable problems are considered and classified.

Teaching methods

Teaching method Contact Online
Lectures 56 h 0 h
Exercises 28 h 0 h

Not lectured 2014-2016.

Teaching language

English

Modes of study

Option 1
Available for:
  • Degree Programme Students
  • Other Students
  • Doctoral Students
  • Exchange Students
Exercise(s)
  • In English
Written exam
  • In English
Option 2
Available for:
  • Degree Programme Students
  • Other Students
  • Doctoral Students
  • Exchange Students
Written exam
  • In English

Evaluation

Numeric 0-5.

Study materials

Lecture notes; Papadimitriou: Computational Complexity, Addison-Wesley, 1994.

Belongs to following study modules

Department of Mathematics and Statistics
Department of Future Technologies
2017–2018
Teaching
Implementation details are unavailable.
Department of Mathematics and Statistics
DP in Mathematics and Statistics
DP in Mathematics
DP in Statistics
MDP in Information Security and Cryptography
Finnish Study Modules