Komplexitätstheorie (SS 2014) - tele-TASK
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.Podcasts
Polynomiale Schaltkreise
Published: July 17, 2014, 11 a.m.Duration: 1 hour 7 minutes 5 seconds
Listed in: Education
Approximation
Published: July 16, 2014, 11 a.m.Duration: 53 minutes 16 seconds
Listed in: Education
Polynomialzeithierarchie (2)
Published: July 10, 2014, 11 a.m.Duration: 56 minutes 50 seconds
Listed in: Education
Polynomialzeithierarchie (1)
Published: July 9, 2014, 11 a.m.Duration: 56 minutes 47 seconds
Listed in: Education
Randomisierte Berechnungen (2)
Published: July 3, 2014, 11 a.m.Duration: 40 minutes 55 seconds
Listed in: Education
Randomisierte Berechnungen (1)
Published: July 2, 2014, 11 a.m.Duration: 1 hour 6 minutes 40 seconds
Listed in: Education
NP und coNP
Published: June 26, 2014, 11 a.m.Duration: 1 hour 1 minute 17 seconds
Listed in: Education
Weitere NP-vollstandige Probleme (3)
Published: June 25, 2014, midnightDuration: 1 hour 8 minutes 55 seconds
Listed in: Education
Weitere NP-vollstandige Probleme (2)
Published: June 19, 2014, 11 a.m.Duration: 54 minutes 32 seconds
Listed in: Education
Weitere NP vollstandige Probleme (1)
Published: June 18, 2014, 11:30 a.m.Duration: 58 minutes
Listed in: Education
Weitere Charakterisierungen von NP
Published: June 18, 2014, 11 a.m.Duration: 19 minutes 30 seconds
Listed in: Education
NP-Vollstandigkeit
Published: June 12, 2014, 11 a.m.Duration: 35 minutes 2 seconds
Listed in: Education
Reduktion und Vollstandigkeit (3)
Published: June 11, 2014, 11 a.m.Duration: 57 minutes 57 seconds
Listed in: Education
Reduktion und Vollstandigkeit (2)
Published: May 22, 2014, 11 a.m.Duration: 55 minutes 20 seconds
Listed in: Education
Reduktion und Vollstandigkeit (1)
Published: May 21, 2014, midnightDuration: 1 hour 7 minutes 3 seconds
Listed in: Education
Erreichbarkeitsmethode 2/2
Published: May 15, 2014, 11 a.m.Duration: 50 minutes 58 seconds
Listed in: Education
Erreichbarkeitsmethode 1/2
Published: May 14, 2014, midnightDuration: 56 minutes 39 seconds
Listed in: Education
Hierarchie-Theoreme
Published: May 8, 2014, 11:50 a.m.Duration: 33 minutes 29 seconds
Listed in: Education
Komplexitatsklassen
Published: May 8, 2014, 11 a.m.Duration: 41 minutes 52 seconds
Listed in: Education
Nichtdeterministische Turing Maschinen
Published: May 7, 2014, 11 a.m.Duration: 1 hour 8 minutes 46 seconds
Listed in: Education
Raumkomplexitat und Platzsparen
Published: April 30, 2014, 11 a.m.Duration: 57 minutes 14 seconds
Listed in: Education
Lineares Beschleunigen
Published: April 24, 2014, 11 a.m.Duration: 51 minutes 32 seconds
Listed in: Education
Turing Maschinen
Published: April 23, 2014, 9 a.m.Duration: 1 hour 33 minutes 51 seconds
Listed in: Education
Probleme und Algorithmen
Published: April 10, 2014, 11 a.m.Duration: 1 hour 16 minutes 55 seconds
Listed in: Education
Einfuhrung und Inhalt
Published: April 9, 2014, 11 a.m.Duration: 51 minutes 59 seconds
Listed in: Education
Weitere NP-vollstandige Probleme (4)
Published: June 27, 2012, 11 a.m.Duration: 1 hour 26 minutes 3 seconds
Listed in: Education