[Lecture 7:3/3] Using Randomness in Computer Science

Name: [Lecture 7:3/3] Using Randomness in Computer Science
Uploaded: 2011-02-21T08:17:28+00:00
Duration: 57 min 16 s
Channel: Nicolas Schabanel
Description: Lecture @ MPRI Paris Master of Computer Science (Université Paris Diderot) by Nicolas Schabanel<br />Feb 16, 2011 - 16:15-19:15 - Exhaustive Sampling<br />• Exhaustive guessing: a polynomial time randomized (1+&epsi;)-approximation (PTRAS) for Max-CUT in dense graphs

Nicolas Schabanel

Lecture @ MPRI Paris Master of Computer Science (Université Paris Diderot) by Nicolas Schabanel Feb 16, 2011 - 16:15-19:15 - Exhaustive Sampling • Exhaustive guessing: a polynomial time randomized (1+ε)-approximation (PTRAS) for Max-CUT in dense graphs

Catégorie

Commentaires

Recommandations