![]() |
![]() |
#1 |
Tribal Bullet
Oct 2004
67318 Posts |
![]()
New dissertation here, reporting on work started back in 2008. There are a lot of practical techniques in here, though it may be tricky to automate using them.
Last fiddled with by jasonp on 2011-03-06 at 21:37 Reason: change URL |
![]() |
![]() |
![]() |
#2 |
"Vincent"
Apr 2010
Over the rainbow
5·569 Posts |
![]()
It seems interesting.
But my limited math knowledge doesn't help me much here. Could it help Msieve? |
![]() |
![]() |
![]() |
#3 |
Tribal Bullet
Oct 2004
5×709 Posts |
![]()
If Msieve or any of the scripts that automate NFS factorizations supported test sieving, we could modify them to extrapolate the number of relations needed from the sieving, and from there to the approximate sieving time. It's only worth the trouble if the sieving time is going to be long, but short sieving jobs can fall back on tabulated history anyway.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
gpuowl: runtime error | SELROC | GpuOwl | 69 | 2021-09-29 10:07 |
runtime question | yoyo | YAFU | 1 | 2015-01-08 07:07 |
Predicting the needed time for high n-values? | Rincewind | Sierpinski/Riesel Base 5 | 4 | 2009-06-11 12:24 |
ECM Runtime and F20 | D. B. Staple | Factoring | 11 | 2007-12-12 16:52 |
Predicting the Amount of CPU Power Needed to LL Test Exponent p | jinydu | Math | 19 | 2005-02-07 02:52 |