On Thu, Jul 8, 2010 at 5:24 PM, Jason Moxham wrote:
>
> maybe , I would have to look it up , basically mulhi goes like this
>
> calculate mul_short (either basecase or divide and conquer)
> mul_short is like mul_high but with 2 extra digits calculated , these 2
> extra
> digits give enough info t
On Thursday 08 July 2010 16:00:46 Fredrik Johansson wrote:
> On Thu, Jul 8, 2010 at 4:51 PM, Jason Moxham
wrote:
> > The mulhi and mullo are exact unlike the mulmid , we could do an
> > approximate
> > mulhi which would be marginally faster.
> >
> > Jason
>
> Yes, that would be very nice. I assume
On Thu, Jul 8, 2010 at 4:51 PM, Jason Moxham wrote:
>
> The mulhi and mullo are exact unlike the mulmid , we could do an
> approximate
> mulhi which would be marginally faster.
>
> Jason
>
Yes, that would be very nice. I assume approximate mulhi would be give the
exact result +/- 1?
Fredrik
--
On Thursday 08 July 2010 08:26:02 Fredrik Johansson wrote:
> On Wed, Jul 7, 2010 at 11:36 PM, Jason Moxham
wrote:
> > On Tuesday 06 July 2010 10:49:35 Bill Hart wrote:
> > > Frederick is working on mpz_mulhi, however one thing we *really* need
> > > (since the interesting case for his applications
On Wed, Jul 7, 2010 at 11:36 PM, Jason Moxham wrote:
> On Tuesday 06 July 2010 10:49:35 Bill Hart wrote:
> > Frederick is working on mpz_mulhi, however one thing we *really* need
> > (since the interesting case for his applications is for a small number
> > of limbs) is an x86_64 assembly version
