Course details

Complexity (in English)

SLOa Acad. year 2024/2025 Summer semester 5 credits

Turing machines as a basic computational model for computational complexity analysis, time and space complexity on Turing machines. Alternative models of computation, RAM and RASP machines and their relation to Turing machines in the context of complexity. Asymptotic complexity estimations, complexity classes based on time- and space-constructive functions, typical examples of complexity classes. Properties of complexity classes: importance of determinism and non-determinism in the area of computational complexity, Savitch theorem, relation between non-determinism and determinism, closure w.r.t. complement of complexity classes, proper inclusion between complexity classes. Selected advanced properties of complexity classes: Blum theorem, gap theorem. Reduction in the context of complexity and the notion of complete classes. Examples of complete problems for different complexity classes. Deeper discussion of P and NP classes with a special attention on NP-complete problems (SAT problem, etc.). Relationship between decision and optimization problems. Methods for computational solving of hard optimization problems: deterministic approaches, approximation, probabilistic algorithms. Relation between complexity and cryptography.  Deeper discussion of PSPACE complete problems, complexity of formal verification methods.

Guarantor

Rogalewicz Adam, doc. Mgr., Ph.D. (DITS)

Course coordinator

Lengál Ondřej, Ing., Ph.D. (DITS)

Language of instruction

English

Completion

Examination (written+oral)

Time span

  • 26 hrs lectures
  • 26 hrs projects

Assessment points

  • 70 pts final exam
  • 30 pts projects

Department

Department of Intelligent Systems (UITS)

Lecturer

Lengál Ondřej, Ing., Ph.D. (DITS)
Rogalewicz Adam, doc. Mgr., Ph.D. (DITS)

Instructor

Rogalewicz Adam, doc. Mgr., Ph.D. (DITS)

Learning objectives

Familiarize students with the complexity theory, which is necessary to understand practical limits of algorithmic problem solving on physical computational systems.
Familiarize students with a selected methods for solving hard computational problems.
Understanding theoretical and practical limits of arbitrary computational systems. Ability to use a selected methods for computationally hard problems.

Recommended prerequisites

Prerequisite knowledge and skills

Formal language theory and theory of computability on master level.

Study literature

  • Kozen, D.C.: Theory of Computation, Springer, 2006, ISBN 1-846-28297-7
  • Bovet, D.P., Crescenzi, P.: Introduction to the Theory of Complexity, Prentice Hall International Series in Computer Science, 1994, ISBN 0-13915-380-2
  • Goldreich, O.: Computational Complexity: A Conceptual Perspective, Cambridge University Press, 2008, ISBN 0-521-88473-X

Fundamental literature

  • Papadimitriou, C. H.: Computational Complexity, Addison-Wesley, 1994, ISBN 0201530821
  • Arora, S., Barak, B.: Computational Complexity: A Modern Approach, Cambridge University Press, 2009, ISBN: 0521424267. Dostupné online.
  • Hopcroft, J.E. et al: Introduction to Automata Theory, Languages, and Computation, Addison Wesley, 2001, ISBN 0-201-44124-1
  • Ding-Zhu Du, Ker-I Ko: Theory of Computational Complexity, 2nd Edition, Wiley 2014, ISBN: 978-1-118-30608-6
  • Gruska, J.: Foundations of Computing, International Thomson Computer Press, 1997, ISBN 1-85032-243-0

Syllabus of lectures

  1. Introduction. Complexity, time and space complexity.
  2. Matematical models of computation, RAM, RASP machines and their relation with Turing machines.
  3. Asymptotic estimations, complexity classes, determinism and non-determinism from the point of view of complexity.
  4. Relation between time and space, closure of complexity classes w.r.t. complementation, proper inclusion of complexity classes.
  5. Blum theorem. Gap theorem.
  6. Reduction, notion of complete problems, well known examples of complete problems.
  7. Classes P and NP. NP-complete problems. SAT problem.
  8. Travelling salesman problem, Knapsack problem and other important NP-complete problems
  9. NP optimization problems and their deterministic solution: pseudo-polynomial algorithms, parametric complexity
  10. Approximation algorithms.
  11. Probabilistic algorithms, probabilistic complexity classes.
  12. Complexity and cryptography
  13. PSPACE-complete problems. Complexity and formal verification.

Syllabus - others, projects and individual work of students

3 projects dedicated on different aspects of the complexity theory.

Progress assessment

  • 3 projects - 10 points each (recommended minimal gain is 15 points)

  • Final exam is performed in written form. The maximal amount of points one can get is 70 points



Schedule

DayTypeWeeksRoomStartEndCapacityLect.grpGroupsInfo
Mon lecture 1., 2., 3., 4., 5., 6., 9., 10. of lectures A112 11:0012:5064 1EIT 1MIT 2EIT 2MIT INTE NMAT xx Rogalewicz
Mon lecture 7., 11., 12. of lectures A112 11:0012:5064 1EIT 1MIT 2EIT 2MIT INTE NMAT xx Lengál
Mon lecture 2025-03-31 E105 11:0012:5064 1EIT 1MIT 2EIT 2MIT INTE NMAT xx Rogalewicz
Mon lecture 2025-05-05 A112 11:0012:5064 1EIT 1MIT 2EIT 2MIT INTE NMAT xx

Course inclusion in study plans

Back to top