Re: New GP functions for modular polynomials

Andreas Enge on Mon, 01 Dec 2014 10:31:21 +0100

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

Re: New GP functions for modular polynomials

To: pari-dev@pari.math.u-bordeaux.fr
Subject: Re: New GP functions for modular polynomials
From: Andreas Enge <andreas.enge@inria.fr>
Date: Mon, 1 Dec 2014 10:31:08 +0100
Delivery-date: Mon, 01 Dec 2014 10:31:21 +0100
In-reply-to: <20141130130043.GB25877@yellowpig>
References: <20141117162403.GA5007@yellowpig> <20141128140907.GB1113@debian.eduroam.u-bordeaux.fr> <20141130130043.GB25877@yellowpig>
User-agent: Mutt/1.5.23 (2014-03-12)

On Sun, Nov 30, 2014 at 02:00:43PM +0100, Bill Allombert wrote:
> > How about allowing here as an optional parameter a prime p modulo which
> > the polynomial is reduced? Then internally a special kind of CRT could be
> > used.
> This is not implemented yet.

To start, one could use the trivial implementation and export it already,
and later replace by a more efficient one.

Andreas

Next by Date: Re: ispseudoprimepower()
Next by thread: Re: ispseudoprimepower()
Index(es):
- Date
- Thread