On Friday, January 25, 2013 1:11:15 PM UTC, Dima Pasechnik wrote: > If I read what Volker noticed right, in this code the bulk of time is > spent computing the order of a group of 2x2 matrices by converting it > into a permutation group, via GAP. And the order of the group is never > more than 342 here. A naive algorithm, enumerating the > elements of the matrix group directly, would speed this up hugely, IMHO.
Or port the matrix groups to libgap... -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-devel?hl=en.
