[Lecture 4:1/3] Using Randomness in Computer Science

[Lecture 4:1/3] Using Randomness in Computer Science

Lecture @ MPRI Paris Master of Computer Science (Université Paris Diderot) by Nicolas Schabanelbr Jan 12, 2011 - 16:15-19:15 - Guessing by samplingbr • A lot of certificates puts Zero-P in BPPbr • The presence of a lot of certificates allows linearity testingbr • Random self-reduction allows linearity self-correcting


User: Nicolas Schabanel

Views: 89

Uploaded: 2011-01-31

Duration: 01:00:00

Your Page Title