Why randomized algorithms works

From TCS Wiki
Revision as of 16:21, 31 December 2009 by imported>WikiSysop (Created page with '* Fooling an adversary * Being oblivious (yet being powerful) * Symmetry breaking * Random sampling * Fast reaching a desirable state * Fingerprinting * Probabilistic …')
(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=Why_randomized_algorithms_works&oldid=631"