I cannot reproduce this either now. But anyway, probabilistic algorithms areOn Tue, Nov 13, 2012 at 04:03:01PM -0500, Igor Schein wrote:
> Package: pari
> Version: git-30598f4
>
> ?
> setrand(756);while(1,gettime;rnfkummer(bnrinit(bnfinit(quadpoly(13829,y)),211,1),[5,1;0,1]);print(gettime))
> 5516
> 6340
> 5873
> 5493
> 5432
> 5617
> 5588
> 15386
> 5652
> 5617
> 5429
> 5516
> 5465
> 5712
> 5685
> 5328
> ^C *** at top-level: ...and(756);while(1,gettime;rnfkummer(bnrinit(bn
> *** ^--------------------
> *** rnfkummer: user interrupt after 1min, 40,690 ms.
>
> Nothing catastrophic by any means, but I was curious if there's a reason
> for the 8th iteration to be almost 3 times slower than the average - maybe
> there's a room for improvement somewhere.
expected to have unbounded running time.
Cheers,
Bill.