20091211, 13:47  #1 
"Nancy"
Aug 2002
Alexandria
2,467 Posts 
An Analytic Approach to Subexponential Factoring
Francesco Sica
De Factorisatione Numerorum I : An Analytic Approach to Subexponential Factoring http://arxiv.org/abs/0912.1585 Alex Last fiddled with by akruppa on 20091211 at 13:48 
20091211, 17:17  #2  
Nov 2003
2^{2}×5×373 Posts 
Quote:
gets rid of the (log log N)^(1alpha) term in the exponent for the time complexity of existing algorithms. e.g. NFS runs in time exp( (1+o(1))( (log N)^1/3 (loglog N)^2/3)) this advance would get rid of the (loglog N)^2/3. > A big theoretical speed improvement. If it works. If it is practical. 

20091211, 18:05  #3  
Nov 2003
2^{2}·5·373 Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Best approach for P1?  Mark Rose  PrimeNet  6  20170523 23:58 
Unorthodox approach to primes  Erkan  PrimeNet  7  20170110 03:34 
a backwards approach to Mersenne testing  MiniGeek  Information & Answers  14  20101114 16:16 
Best approach for 130 digits?  boothby  Factoring  10  20091016 17:24 
Factoring with the birthday problem approach  ThiloHarich  Factoring  0  20090818 16:48 