01: Algorithmen 2, Vorlesung, WS 2017/18, 17.10.2017

from Algorithmen 2, Vorlesung, WS17/18 · host Dr. Thomas Worsch

01 | 0:00:00 Starten 0:00:10 Kapitel: Randomisierte Algorithmen 0:01:10 Überblick 0:01:38 Sichtweisen für randomisierte Algorithmen 0:03:33 Fundamentale Änderung 0:04:03 Beispiel: Randomisierter Quicksort 0:05:32 Zufallsvariablen überall 0:05:49 Errinerung an W-Theorie 0:09:32 Standardbeispiel: Würfeln 0:15:26 Algorithmen mit unbekannter Laufzeit 0:16:25 Algorithmen, die ""variierende Ausgaben"" liefern 0:21:05 Vorteile randomisierter Algorithmen 0:23:28 Motivation 0:25:14 Polynome 0:32:21 Ausblick: polynomial identity testing 0:35:27 Randomisierter Quicksort 0:37:27 randQS: Anzahl Vergleiche

Episode metadata supplied by the publisher feed · Published Oct 23, 2017

Embed this episode

Attribution link and audio player

NOW PLAYING

01: Algorithmen 2, Vorlesung, WS 2017/18, 17.10.2017

0:00 42:41

1×

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

Share this episode

Similar Episodes

No similar episodes found.

Similar Podcasts

Route 2 Adventure Peter Route 2 Adventure has interviews, reviews and research for the outdoor enthusiast as well as those in the RV world. Join Pete Robinson and his Airstream Meadowlark as he ventures into a life lived one rivet at a time.

Frequently Asked Questions

How long is this episode of Algorithmen 2, Vorlesung, WS17/18?

This episode is 42 minutes long.

When was this Algorithmen 2, Vorlesung, WS17/18 episode published?

This episode was published on October 23, 2017.

Can I download this Algorithmen 2, Vorlesung, WS17/18 episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.

URL copied to clipboard!