Don't know it it is any help, but at 3,000,000 bits, FLINT integer multiplication is about 1.4 times the speed of the current GMP. Presumably Strassen does some integer multiplications.
Bill. On 24 Oct, 03:00, "William Stein" <[EMAIL PROTECTED]> wrote: > > Actually, soon I will be doing matrix multiply over Z/p^N for some > > large N, so the matrix_modn_dense thing is relevant. > > Maybe, but unfortunately matrix_modn_dense is only for small p. > > > Another question: for large moduli like this, does it delay the > > reduction until after the adds/subs, either in classical or strassen? > > This would mean only O(n^2) reductions instead of O(n^3). > > matrix_modn_dense does do delayed mod. But it's only mod p > for smallish p. You'll likely have to create a new class such as > matrix_modbign_dense or something. Don't call it matrix_modN_dense :-). > > -- William --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
