I tried to build LiDIA so I could do some timings. But it just doesn't build. It's a standard Opteron machine with G++ and GMP on it. I'm just doing a standard build, but it complains in ring_matrix.h that some function is missing.
This is a shame because I understand LiDIA has an implementation of this algorithm: http://pages.cpsc.ucalgary.ca/~jacobs/PDF/heidel.pdf This is the algorithm we need for computing class groups, unless there's been something better since (the similar algorithm based on the number field sieve is not practical for us). I haven't looked at what Pari uses, but I don't see how it could do better than that. I suspect they use one of Buchmann's algorithms, which would be much slower both in practice and asymptotically. I'll check into what it uses. Bill. --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
