Randomized Algorithms (Spring 2010)/More on Chernoff bounds

From TCS Wiki

Revision as of 13:16, 22 February 2010 by imported>WikiSysop (Created page with '== Permutation Routing == Now we introduce a more "serious" application of Chernoff bounds: the two-phase randomized algorithm for the permutation routing in a hypercube. == Jo…')

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

Jump to navigation Jump to search

Permutation Routing

Now we introduce a more "serious" application of Chernoff bounds: the two-phase randomized algorithm for the permutation routing in a hypercube.

Johnson-Lindenstrauss Theorem

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