Moses - Computational Complexity

Display language

Diese Modulbeschreibung gilt nicht im aktuellen Semester.

Die Modulbeschreibung gilt nur für den Zeitraum SS 2017 - WiSe 2021/22. Die Version für das aktuelle Semester (SoSe 2024) finden Sie hier: Modulbeschreibung des SoSe 2024

Module / Version:
#40379 / #6

Validity:
SS 2017 - WiSe 2021/22

Default display language:
English

Module title:
Computational Complexity

Credits:
9

Responsible person:
Niedermeier, Rolf

Grading:
benotet

Type of exam:
Mündliche Prüfung

Zugehörigkeit

Faculty:
Fakultät IV

Institute:
Institut für Softwaretechnik und Theoretische Informatik

Area of expertise:
34351100 FG Algorithmik und Komplexitätstheorie

Prüfungsausschuss:
No information

Kontakt

Office:
TEL 5-1

Contact person:
Thielcke, Christlinde

E-mail address:
lehre@akt.tu-berlin.de

Website:

http://www.akt.tu-berlin.de/menue/teaching

Learning Outcomes

On successful completion, students will be able to: - estimate the computational costs for solving fundamental problems - classify discrete computational problems according to their computational complexity using reductions and standard complexity classes - understand structural properties of complexity classes - make qualitative and quantitative statements about computational complexity questions

Content

Introduction into structural complexity theory, with particular emphasis on complexity resources time and space. Particular topics are: - complexity classes - reductions between problems - theory of the NP-completeness and the P vs. NP question - hierarchy theorems and polynomial time hierarchy - interactive proof systems

Module Components

Pflichtteil:

All Courses are mandatory.

Course Name	Type	Number	Cycle	Language	SWS	VZ
Computational Complexity	VL	0434 L 233	k.A.	No information	4
Computational Complexity	UE	0434 L 233	k.A.	No information	2

Workload and Credit Points

Computational Complexity (VL):

Workload description	Multiplier	Hours	Total
Präsenzzeit	15.0	4.0h	60.0h
Vor-/Nachbereitung	15.0	5.0h	75.0h
			135.0h(~5 LP)

Computational Complexity (UE):

Workload description	Multiplier	Hours	Total
Präsenzzeit	15.0	2.0h	30.0h
Vor-/Nachbereitung	15.0	5.0h	75.0h
			105.0h(~4 LP)

Course-independent workload:

Workload description	Multiplier	Hours	Total
Prüfungsvorbereitung	1.0	30.0h	30.0h
			30.0h(~1 LP)

The Workload of the module sums up to 270.0 Hours. Therefore the module contains 9 Credits.

Description of Teaching and Learning Methods

There is a lecture 4 hours per week presenting the whole course material. The lectures are accompanied by tutorials in which distributed work sheets are solved together.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

a) obligatory: Basic course on automata and complexity b) desirable: Basic knowledge on algorithms

Mandatory requirements for the module test application:

This module has no requirements.

Module completion

Grading

graded

Type of exam

Oral exam

Language

English

Duration/Extent

30 min

Duration of the Module

The following number of semesters is estimated for taking and completing the module:
1 Semester.

This module may be commenced in the following semesters:
Winter- und Sommersemester.

Maximum Number of Participants

This module is not limited to a number of students.

Registration Procedures

Please register at QISPOS or directly at the examination office.

Recommended literature
Christos H. Papadimitriou: Computational Complexity, Addison Wesley, 1994.
Sanjeev Arora, Boaz Barak: Computational Complexity: A Modern Approach, Cambridge University Press, 2009

Assigned Degree Programs

Semester:

Zeige auch ausgelaufene Studiengänge und StuPOs

This module is used in the following Degree Programs (new System):

	Studiengang / StuPO	StuPOs	Verwendungen	Erste Verwendung	Letzte Verwendung
This module is not used in any degree program.

Students of other degrees can participate in this module without capacity testing.

Miscellaneous

This course is not offered regularly, you will find detailed information on our website: http://www.akt.tu-berlin.de/menue/teaching/

Computational Complexity