Complexity Theory (CxT)

Lecture number: 6523-FS2017-0
Start: 2017-02-21
End: 2017-05-30
Venue: Hörraum B077, ExWi, Sidlerstrasse 5
Repetition: From time to time.
Lectures take place on:
  • Tuesday from 14:15 to 17:00


In this course we will give a thorough and self-contained introduction to the area of computational complexity theory. Starting off from the abstract computational model of a Turing machine, we will discuss deterministic and non-deterministic time- and space complexity classes with regard to their structural and algorithmic properties. We will address numerous relevant examples while putting some emphasis on the complexity classes P and NP as well as to the theory of NP-completeness. Some keywords: dynamic complexity measures; deterministic and nondeterministic polynomial time; the P versus NP problem and its relativization, NP completeness; the polynomial hierarchy and PSPACE.
On successful completion of this course, you will be able to:

  • Classify algorithmic problems into complexity classes
  • Determine the known relationships between complexity classes
  • Show that an algorithmic problem in NP-complete
  • Understand the P versus NP problem
  • Discuss problems whose complexity is beyond NP
  • Understand problems with polynomial space complexity



To be announced.