View Single Post
Old 2011-11-07, 13:29   #8
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

26·113 Posts
Default

Quote:
Originally Posted by LaurV View Post
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 is offline