2010/1/9 Bill Hart <goodwillh...@googlemail.com>: > 9) Exact division faster, time O(M(n)). Again, no asymptotically fast > division for us yet. I don't know where we currently stand for the > non-asymptotically fast stuff. This one we need benchmarks for.
I was just thinking about this and it occurred to me this is probably using Hensel or even bidirectional division. We are probably OK when dividing by 1 and 2 limbs, but in general no. We put David Harvey's code which goes some way towards this, into the mpn directory, and never went any further with it. I got distracted by speeding up quotient-remainder division. The whole strategy needs revisiting. Bill.
-- You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to mpir-de...@googlegroups.com. To unsubscribe from this group, send email to mpir-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en.
