View Single Post
Old 2016-05-06, 02:25   #13
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

354310 Posts
Default

Quote:
Originally Posted by xilman View Post
I
If the rumour is correct, then perhaps we can deduce that the algorithm requires finding O(sqrt(N) smooth integers of size bounded by O(sqrt(N)) . I've been thinking about such things for a little while now --- unsucessfully it's needless to say.
What you describe sounds like a N^(1/4) complexity algorithm, which would be much slower than L(1/4) complexity.
jasonp is offline   Reply With Quote