4 ms·
Yes, and the fastest algorithm I know to evaluate that expression takes O(n log n 2^log*(n)) time.
by cperciva 17y ago
Yes, and the fastest algorithm I know to evaluate that expression takes O(n log n 2^log*(n)) time.
- dangoldin 17y agoAh my mistake then. I didn't realize the closed form solution takes that long to evaluate. Couldn't there be a faster way to evaluate it using an algebraic rather than a computational way? I just find the bound you give too high but I may be completely wrong.