e-Approximation
Part of the lecture: Approximation
Nicht genügend Bewertungen
Christoph Meinel
| Datum:: | 14.07.2010 |
| Dauer: | 00:08:59 |
| 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.
Playlists
This segment is not used in any playlist.
Tags added to this content
No tags have been added to this content so far.
Tags added to the series of this content:P vs. NP (1); Theoretische Informatik (1); Turingmaschinen (1);
Tags added to the lecture of this content:Approximation (1); Approximationsschwelle (1); Hamilton Path (1); Knapsack problem (1); Optimierungsproblem (1); SAT problem (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.