Randomized Algorithms (Spring 2010)/Introduction

From TCS Wiki
Revision as of 10:22, 30 December 2009 by imported>WikiSysop
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