Quote:
Originally Posted by LaurV
I am still waiting for an algorithm with complexity O((log n)^a)), with "a" as big as you want, but fixed... >:P

I am just wondering. What do you think 'n' means in this context? I get the feeling that you consider 'n' to be the number being multiplied rather than the number of bits/digits in the number being multiplied.