I want to check for irreducibility of moderate degree polynomials in very large numbers of variables. A typical example is a 20 degree polynomial in 21 variables. The polynomials are expressed as very compact expressions, but blow up terribly if expanded out into monomials.
Does sage have any existing support for irreducibility testing on black box polynomials? There's been a fair amount of work in this area, but a brief glance didn't turn up any implementations as part of sage. Thanks, Geoffrey -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
