Polrootsmod query

James Wanless on Sat, 12 Mar 2011 14:41:36 +0100

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

Polrootsmod query

To: pari-dev@list.cr.yp.to
Subject: Polrootsmod query
From: James Wanless <james@grok.ltd.uk>
Date: Sat, 12 Mar 2011 13:34:35 +0000
Delivery-date: Sat, 12 Mar 2011 14:41:36 +0100
Mailing-list: contact pari-dev-help@list.cr.yp.to; run by ezmlm

Why is PARI's implementation of polrootsmod so fast??? :)))

I've implemented my own version using GMP and Algorithm 1.6.1 of CohenACCANT, but PARI's seems order(s) of magnitude faster.What algorithm does polrootsmod use, pls? Maybe Cantor-Zassenhaussplit etc., ie Cohen Algorithms 3.4.x, using matrices?? I've looked atPARI's code and haven't (yet?) understood it, despite noticing a fewreferences to 'Berlekamp'...

Prev by Date: GP2C support for inline closure and wrappers
Next by Date: Polroots/mod suggestion
Previous by thread: GP2C support for inline closure and wrappers
Next by thread: Polroots/mod suggestion
Index(es):
- Date
- Thread