After completing the course the student is expected to - understand the fundamental limitations of algorithmmic methods - know the basics of computational complexity (especially NP-completeness)
Contents
The fundamental restrictions of algorithmic methods, solvability, deducibility, NP-completeness.
Teaching methods
Teaching method
Contact
Online
Lectures
26 h
0 h
Exercises
10 h
0 h
Teaching language
Finnish
Modes of study
Option
1
Available for:
Degree Programme Students
Other Students
Open University Students
Doctoral Students
Exchange Students
Participation in course work
In
Finnish
Further information
Aktiivinen osallistuminen harjoituksiin ja kirjallinen kuulustelu.
Written exam and weekly exercises
Evaluation
Numeric 1-5.
Study materials
Hopcroft, Motwani, Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley 2001.