Randomized Algorithms (Spring 2010)/Introduction

From TCS Wiki

Revision as of 10:22, 30 December 2009 by imported>WikiSysop

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Fooling an adversary

Being oblivious (yet being powerful)

Symmetry breaking

Random sampling

Fast reaching a desirable state

Fingerprinting

Probabilistic proofs of existence

Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=Randomized_Algorithms_(Spring_2010)/Introduction&oldid=545"