Unlocking the Power of Randomness in Computer Science 🎲
Discover how randomness shapes algorithms and problem-solving in computer science with insights from Nicolas Schabanel's lecture at MPRI Paris. Perfect for enthusiasts and students alike!
Nicolas Schabanel
71 views • Jan 31, 2011
About this video
Lecture @ MPRI Paris Master of Computer Science (Université Paris Diderot) by Nicolas Schabanel<br />Jan 26, 2011 - 16:15-19:15 - Guessing by sampling 2<br />• Application of linearity testing and self-correcting: NP is in PCP(poly(n),1)<br /> - QUADEQ is NP-complete<br /> - A PCP(n^2,1)-verifier for QUADEQ<br />• A constant time (1+ε)-approximation for the size of a maximal matching in a constant degree graph
Video Information
Views
71
Duration
01:00:00
Published
Jan 31, 2011
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now