Thread
:
low-value comments cleared out of FFT thread
View Single Post
2011-11-07, 13:29
#
8
R.D. Silverman
Nov 2003
2
^{6}
·113 Posts
Quote:
Originally Posted by
LaurV
RDS rulz... Well, you are right... Mea culpa.
I am still waiting for an algorithm with complexity O((log n)^a)), with "a" as big as you want, but fixed... >:P
PROVABLY IMPOSSIBLE.
The proof is trivial.
R.D. Silverman
View Public Profile
Find More Posts by R.D. Silverman