|Thomas D. Dean on Mon, 28 Jan 2013 18:50:31 +0100|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|Re: Field inclusion problem|
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? Tom Dean