Thread
:
low-value comments cleared out of FFT thread
View Single Post
2011-11-07, 13:15
#
7
LaurV
Romulan Interpreter
Jun 2011
Thailand
5
2
·7·53 Posts
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
Last fiddled with by LaurV on 2011-11-07 at
13:21
LaurV
View Public Profile
Visit LaurV's homepage!
Find More Posts by LaurV