Podchaser Logo
Home
Komplexitätstheorie (SS 2010) - Created with tele-TASK - more than video! Powered by Hasso Plattner Institute (HPI).Episode from the podcastKomplexitätstheorie (SS 2010) - Created with tele-TASK - more than video! Powered by Hasso Plattner Institute (HPI).
NP-vollständige unäre Sprache

NP-vollständige unäre Sprache

Released Tuesday, 20th July 2010
Good episode? Give it some love!
NP-vollständige unäre Sprache

NP-vollständige unäre Sprache

NP-vollständige unäre Sprache

NP-vollständige unäre Sprache

Tuesday, 20th July 2010
Good episode? Give it some love!
Rate Episode
About
InsightsPodchaser Pro
Reviews
Credits
Lists
Transcript

Unlock Episode Insights with

Podchaser Logo PRO

Reach • Demographics • Contacts • More

Pro Features

Audience & Reach for NP-vollständige unäre Sprache

See a breakdown of Audience & Reach for NP-vollständige unäre Sprache

Unlock Episode Audience & Reach with Podchaser Pro

Brand Safety for NP-vollständige unäre Sprache

See Brand Safety for NP-vollständige unäre Sprache

Unlock Episode Brand Safety with Podchaser Pro

Ad Rate Card of Komplexitätstheorie (SS 2010) - Created with tele-TASK - more than video! Powered by Hasso Plattner Institute (HPI).

How much does it cost to advertise on Komplexitätstheorie (SS 2010) - Created with tele-TASK - more than video! Powered by Hasso Plattner Institute (HPI).?

PlacementCost
Pre-rollAds played before an episode.
Mid-rollAds played during an episode.
Post-rollAds played after an episode.

Frequently Asked Questions about Komplexitätstheorie (SS 2010) - Created with tele-TASK - more than video! Powered by Hasso Plattner Institute (HPI).

Rate
Get this podcast via API

From The Podcast

Komplexitätstheorie (SS 2010) - Created with tele-TASK - more than video! Powered by Hasso Plattner Institute (HPI).

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.

Join Podchaser to...

  • Rate podcasts and episodes
  • Follow podcasts and creators
  • Create podcast and episode lists
  • & much more

Episode Tags

Do you host or manage this podcast?
Claim and edit this page to your liking.
,

Unlock more with Podchaser Pro

  • Audience Insights
  • Contact Information
  • Demographics
  • Charts
  • Sponsor History
  • and More!
Pro Features
Podchaser Logo

Podchaser is the ultimate destination for podcast data, search, and discovery. Learn More