Timeline for Lower bound for sum of binomial coefficients?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 9, 2018 at 11:55 | history | edited | Brendan McKay | CC BY-SA 3.0 |
added 105 characters in body
|
| S Jan 9, 2018 at 11:30 | history | suggested | Erel Segal-Halevi | CC BY-SA 3.0 |
Copy the relevant definitions from the linked paper, since in the paper they are sparsed over several pages.
|
| Jan 9, 2018 at 10:46 | review | Suggested edits | |||
| S Jan 9, 2018 at 11:30 | |||||
| Sep 23, 2011 at 3:07 | comment | added | user13006 | Brendan, Thanks. You might be referring to this: Central Binomial Tail Bounds, Matus Telgarsky, 2009. arxiv.org/abs/0911.2077v2 At this point I'd rather avoid the normal distribution and erf(), but I understand it's certainly useful, and it seems that it's hard to get a tight lower bound without it. | |
| Sep 3, 2011 at 7:36 | history | answered | Brendan McKay | CC BY-SA 3.0 |