Bill Allombert on Mon, 28 Jan 2013 19:11:09 +0100

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: Field inclusion problem

On Mon, Jan 28, 2013 at 09:50:36AM -0800, Thomas D. Dean wrote:
> On 01/24/13 01:20, Karim Belabas wrote:
> >
> >This is more complicated than just nffactor above, a few hours in this
> >case and you'll probably get no improvement. It might be better to start
> >from T = polredbest(A) [ will be monic ], and iterate polcompositum(T,T)
> >and polredbest() to obtain a "simple" (monic) polynomial.
> gp > polred(polyB)
> gp 2.5.3, Core i7-3930k O.C. 4.2Ghz, 16GB RAM, after 65 hours this is
> still running.
> Any guesstimate on running time?

Maybe try polred(polyB,1) to skip the factorization and use \g4 to set
the DEBUG output.

If you are not using windows, you can interrupt your current computation
with Control-C, do \g4 and enter return to continue.
If it looks like running ECM factorisation, kill it and restart with