Ilya Zakharevich on Wed, 20 Jan 1999 20:18:36 -0500

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

Re: Memory use when factoring big polynomials

On Thu, Nov 05, 1998 at 01:00:01PM +0100, Karim BELABAS wrote:
> Actually, it is trivial to implement a very crude form of multivariate
> factorisation (using Kronecker's trick. I just spent 5 minutes implementing
> it in GP). It certainly wouldn't be able to match the standard packages (I
> guess they all use some clever multivariate Hensel lift), but it might
> succeed with x^2 - y^2 in a sensible amount of time (in GP it does...)
> I'll include that in 2.0.13 (_really_ time to release 2.0.12.alpha now, if I
> try to include other improvements now, it will again be delayed...)

Did it come through?  It does not look so...