Timeline for Extraction of Coefficients in the Exponential Function of a Series
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 24, 2015 at 6:27 | vote | accept | Ofir Gorodetsky | ||
| Nov 23, 2015 at 21:45 | answer | added | Fredrik Johansson | timeline score: 4 | |
| Nov 23, 2015 at 20:01 | comment | added | Ira Gessel | Note that $g=e^f$ implies $g' = gf'$. This gives a recurrence for the coefficients of $g$ that's easy to use. | |
| Nov 23, 2015 at 18:53 | answer | added | Igor Rivin | timeline score: 2 | |
| Nov 23, 2015 at 18:25 | comment | added | Felipe Voloch | You might be interested in the work of K. Kedlaya and C. Umans. Fast modular composition in any characteristic. Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS). pages 146-155. 2008. | |
| Nov 23, 2015 at 18:21 | history | edited | Ofir Gorodetsky | CC BY-SA 3.0 |
added 280 characters in body
|
| Nov 23, 2015 at 18:10 | history | asked | Ofir Gorodetsky | CC BY-SA 3.0 |