Timeline for Complexity of high-order differentiation
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 24, 2015 at 15:29 | answer | added | Fredrik Johansson | timeline score: 1 | |
| Sep 8, 2010 at 12:10 | answer | added | Jacques Carette | timeline score: 3 | |
| Jul 28, 2010 at 5:31 | history | edited | Suresh Venkat |
edited tags
|
|
| Jul 28, 2010 at 1:18 | comment | added | Fredrik Johansson | Thanks, this is the terminology I'm looking for. So I guess the question is: is there a better way than the naive one to evaluate this polynomial (the naive method being to generate the expanded polynomial and evaluate it term by term)? | |
| Jul 28, 2010 at 1:14 | history | edited | Fredrik Johansson |
edited tags
|
|
| Jul 28, 2010 at 0:53 | answer | added | lhf | timeline score: 0 | |
| Jul 28, 2010 at 0:13 | comment | added | Qiaochu Yuan | For a particular n the relevant polynomial is essentially the cycle index polynomial of S_n: qchu.wordpress.com/2009/06/24/… . So knowing how to do this computation for arbitrary f is essentially equivalent to knowing the cycle index polynomial, which encodes a lot of information. | |
| Jul 28, 2010 at 0:07 | comment | added | Steve Huntsman | en.wikipedia.org/wiki/… | |
| Jul 27, 2010 at 23:56 | history | asked | Fredrik Johansson | CC BY-SA 2.5 |