I just released NTL 11.2.0 at http://www.shoup.net/ntl
The main change is a new and improved implementation of the Schoenhage-Strassen FFT for multiplication of polynomials over the integers. The new implementation includes a truncated FFT algorithm, the "sqrt 2" trick, and better engineered low-level "butterfly" code. See http://www.shoup.net/ntl/doc/tour-changes.html for details, including some benchmarks. Also see http://www.shoup.net/ntl/benchmarks.pdf for an updated version of NTL vs FLINT report. -- 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.
