News

31.03.2014

openHPI Course "Internetworking"

A new openHPI course about "Internetworking" starts on March 31, 2014. The course is held by Prof. Dr. Christoph Meinel ... [more]
03.02.2014

openHPI Course "Parallel Programming Concepts"

A new openHPI course about "Parallel Programming Concepts" will start on February 3rd, 2014. The course will be held by ... [more]
28.10.2013

New openHPI course

Business Process Modeling and Analysis held by Prof. Dr. Mathias Weske starts on October 28, 2013. More information here: https ... [more]

Statistics

userclicks 31 M
lecture 5277
activelecturer 1950
series 422

Approximation

Part of the series: Komplexitätstheorie (SS 2010)

Approximation
Not enough ratings.

Prof. Dr. Christoph Meinel

Date:14.07.2010
Duration:00:58:51
Language:de

Description of the series:

Ziel der Komplexitätstheorie ist die Quantifizierung von Computerressourcen (Rechenzeit, Speicherplatz, Hardwareaufwand, Kommunikationsaufwand, ...), die zur algorithmischen Lösung konkreter Probleme bzw. von Problemklassen benötigt werden. Die Vorlesung, die sich an Master-Studenten der Studiengänge IT Systems Engineering, Informatik und Mathematik wendet, bietet eine fundierte Einführung in die Komplexitätstheorie. Schwerpunktmäßig wird die Bedeutung komplexitätstheoretischer Aussagen für den Algorithmenentwurf herausgearbeitet.

Image of
Not enough ratings.
Dur.: 00:05:21
Lang.: de
Play scene
Image of
Not enough ratings.
Dur.: 00:08:59
Lang.: de
Play scene
Image of
Not enough ratings.
Dur.: 00:09:09
Lang.: de
Play scene
Image of
Not enough ratings.
Dur.: 00:12:28
Lang.: de
Play scene
Add to my playlist
Dear user,
with the playlist function you'll be able to create your own lecture video playlists.
However, in order to link all your playlists with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
Playlists

This content is not used in any playlist.

Overview of the globally available Notes
You need javascript to use this function
Tags added to this content

Approximation (1); Approximationsschwelle (1); Hamilton Path (1); Knapsack problem (1); Optimierungsproblem (1); SAT problem (1);

Tags added to the series of this content:

P vs. NP (1); Theoretische Informatik (1); Turingmaschinen (1);

Tag this content

Please enable javascript to use this function.

Dear user,
with the tagging function you'll be able to add taggs to videos.
However, in order to link all your tags with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
Links added to this content

No links have been added to this content so far.

Add Link to this content

Please enable javascript to use this function.

Dear user,
with the links function you'll be able to add links to other resources to this content.
However, in order to link all your links with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.