On Saturday 15 December 2007 15:35, Joel B. Mohler wrote: > > Note that NTL does implement factoring in ZZ[] and moreover it does > > so asymptotically *very* quickly. It's only for small degree where I > > once noticed pari being faster and made that the default -- and maybe > > that had to do with bad turning when building NTL! So you might > > want to consider wrapping ZZ[] factoring via NTL, which I'm sure you > > can easily do since you led the charge for rewraping all of NTL! > > Yeah, I thought about doing that and started looking at ZZX factor stuff. > Is there an arbitrary factoring function? All I could find is factoring > for special cases (square-free, etc) and I was too lazy to try and figure > out what I was supposed to do. I'll be looking into this further.
Right, just so no one else decides to look at NTL documentation to tell me the obvious -- there is the "factor" function. -- Joel --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
