Bill Allombert on Thu, 29 Aug 2019 10:27:30 +0200


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

Re: the minimal polynomial over the composite field


On Tue, Aug 27, 2019 at 02:38:58PM +0900, macsyma wrote:
> Thank you, Bill.
> 
> Your method uses galoisinit(), but at least for my purposes, 
> the speed of it is not enough.
> For example, the timing for only galoisinit(nfsplitting()) are
> 
> ? for(n=2,16,galoisinit(nfsplitting(x^n-2)));
> time = 4,165 ms.
> 
> ? galoisinit(nfsplitting(x^17-2));
> time = 33min, 16,082 ms.

Of course, that is why I said one need to adapt these method to
nfsplitting(,,2).
I have some code to help with this that I will post later.

Cheers,
Bill