Re: caching of transforms used for large multiplications

2013-06-14 Thread Philip McLaughlin
Daniel Lichtblau wrote: That said, I confess I am not sure there is much need for this outside of subquadratic gcd code. If it is not more generally useful, then I guess this automation would only be of benefit to a limited set of users. (Like, maybe four of us.) Years ago I published a

Re: caching of transforms used for large multiplications

2013-06-14 Thread Torbjorn Granlund
Daniel Lichtblau d...@wolfram.com writes: If you do not manage to locate them I can scan and send a pdf. (Least I can do for someone who shared a room for two months with that Torbjörn fellow..) I started to write a reply, but decided against sending it after I read this unprovoked

Re: caching of transforms used for large multiplications

2013-06-14 Thread Daniel Lichtblau
On 06/14/2013 02:27 PM, Torbjorn Granlund wrote: Daniel Lichtblaud...@wolfram.com writes: If you do not manage to locate them I can scan and send a pdf. (Least I can do for someone who shared a room for two months with that Torbjörn fellow..) I started to write a reply, but decided

Re: caching of transforms used for large multiplications

2013-06-14 Thread Daniel Lichtblau
On 06/14/2013 12:02 PM, Philip McLaughlin wrote: Daniel Lichtblau wrote: That said, I confess I am not sure there is much need for this outside of subquadratic gcd code. If it is not more generally useful, then I guess this automation would only be of benefit to a limited set of users.

Re: caching of transforms used for large multiplications

2013-06-14 Thread Torbjorn Granlund
Daniel Lichtblau d...@wolfram.com writes: I simply have no idea why you would choose to take such offense. If it serves any purpose, it is one I quite fail to see. That said, I'll not trouble you with further communication. If you cannot assume a professional attitude on the GMP lists,