Hi, The current Hermite normal form algorithm in Sage for matrices over k[x] seems embarrassingly slow. It is a generic algorithm for matrices over PIDs. What would be possible ways to improve the situation? Any reference to literature or implementations or like would be welcome. Thanks.
-- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
