随机算法 (Fall 2011)/Lovász Local Lemma: 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.

24 July 2011

  • curprev 04:0104:01, 24 July 2011‎ imported>WikiSysop‎ 16,408 bytes +9,102‎ No edit summary
  • curprev 04:0004:00, 24 July 2011‎ imported>WikiSysop‎ 7,306 bytes +7,306‎ Created page with '= Lovász Local Lemma= Consider a set of "bad" events <math>A_1,A_2,\ldots,A_n</math>. Suppose that <math>\Pr[A_i]\le p</math> for all <math>1\le i\le n</math>. We want to show t…'
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=随机算法_(Fall_2011)/Lovász_Local_Lemma"