Timeline for Nontrivial theorems with trivial proofs
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 6, 2016 at 21:12 | comment | added | Michael Hardy | In the version that says $\Pr(A_1\cup \cdots\cup A_n) \le \Pr(A_1)+\cdots+\Pr(A_n),$ this is called Bonferroni's inequality. $\qquad$ | |
| Mar 4, 2014 at 11:39 | comment | added | Campello | Thumbs up for this answer. Every single paper in Coding Theory uses the "union bound". I remember the first time I read a paper that uses the "union bound". I didn't know the meaning of the expression at that time and had to google it. My reaction was: pff... is THAT the so-called union bound? | |
| May 25, 2011 at 3:56 | history | answered | Scott Aaronson | CC BY-SA 3.0 |