Timeline for Bounded convolutions with binomial coefficients
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 15, 2014 at 22:07 | comment | added | Mikael Vejdemo-Johansson | No, this is unrelated to the tie-knot thing; it's for a complexity analysis of an algorithm. | |
| Apr 14, 2014 at 20:56 | comment | added | Per Alexandersson | Does this has anything to do with tying ties? | |
| Feb 13, 2014 at 21:08 | comment | added | The Masked Avenger | Indeed, one can use something like 5k to replace k^2. Looks like you found something more suitable. | |
| Feb 13, 2014 at 19:54 | history | answered | Mikael Vejdemo-Johansson | CC BY-SA 3.0 |