随机算法 (Fall 2011)/Chernoff Bound for Expander Walks: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

25 July 2011

  • curprev 02:2202:22, 25 July 2011‎ imported>WikiSysop‎ 582 bytes +582‎ Created page with '= Random Walks Resemble Independent Sampling= {{Theorem|Theorem (Ajtai-Komlós-Szemerédi 1987, Alon-Feige-Wigderson-Zuckerman 1995) | :Let <math>G(V,E)</math> be an <math>n</mat…'
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=随机算法_(Fall_2011)/Chernoff_Bound_for_Expander_Walks"