Introduction to Complexity Theory

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Introduction to Complexity Theory

Lehrveranstaltung mit SWS 2/1/0 (Vorlesung/Übung/Praktikum) in WS 2014



Umfang (SWS)

  • 2/1/0



  • Mündliche Prüfung


Complexity Theory studies the computational properties of decision problems. In this course, we introduce some of the most important notions of complexity theory. We define the basic complexity classes (P, NP, PSpace, etc.) and provide tools for showing that a problem belongs to, or is as hard as any problem in these classes.

The course is aimed to students with little or no knowledge of the topic.
  • Christos H. Papadimitriou. Computational Complexity, Addison Wesley, 1994.
  • Michael Sipser. Introduction to the Theory of Computation, PWS, 1997.