John, > I can easily factor mod two primes around 10^7 and then use CRT, > though that is a bit of a pain. So my question is: what's this limit > on the size of primes p for which factorization over GF(p)[X,Y] is > possible, where does this limit come from, and is it documented?
the limit is p < 2^29 for factorization over GF(p)[X,Y]. See http://trac.sagemath.org/sage_trac/ticket/11829. Note however that Singular is broken for such computations: http://trac.sagemath.org/sage_trac/ticket/10902. Paul -- 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
