Karim Belabas on Tue, 25 Sep 2018 15:09:20 +0200


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

Re: polredbest() and polredabs() 

* J E Cremona [2018-09-25 13:49]:
> According to http://pari.math.u-bordeaux.fr/dochtml/html-stable/ the
> function polredbest() "computes an LLL-reduced basis for the ring of
> integers of ℚ[X]/(T), then ..."   which seems to imply that some expensive
> work, including factorization of the discriminant, is being done.

> Is the documentation wrong?  Or does polredbest() indeed do the hard work?

Yes, this is imprecise. The documentation should read "LLL-reduced basis
for an order in Q[X]/(T)...". [ It now does, in 'master'. ]

The function correctly states that it runs in polynomial time (wrt. the
size of its input).

Cheers,

    K.B.
--
Karim Belabas, IMB (UMR 5251)  Tel: (+33) (0)5 40 00 26 17
Universite de Bordeaux         Fax: (+33) (0)5 40 00 21 23
351, cours de la Liberation    http://www.math.u-bordeaux.fr/~kbelabas/
F-33405 Talence (France)       http://pari.math.u-bordeaux.fr/  [PARI/GP]
`