On Thu, Dec 24, 2009 at 7:45 AM, Simon King <simon.k...@nuigalway.ie> wrote: > Hi! > > Suppose you have a multivariate polynomial p, and you want to know one > non-constant factor of it. You don't need a complete factorisation, > and on the opposite you don't need a proof of irreducibility. > > You could do p.factor(proof=False). But this may still take quite a > long time, since apparently it still attempts to find as many factors > as possible. > > Is there any option that provides a compromise? Say, p.factor > (timelimit=60): It would compute at most 60 seconds, and would return > the finest factorisation found in that time. > > If there isn't: Do you see a clear way to implement such option? >
Since factor is just a light wrapper around Singular, do you know what the answer to the analogous question is in Singular? If not, and their documentation isn't clear, you make email them. I've cc'd the libsingular group. In the long run, we really, really need to implement our own multivariate factorization routines... William -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
