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 w
On Dec 15, 2007 12:35 PM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
>
> On Sat, Dec 15, 2007 at 11:12:12AM -0800, William Stein wrote:
> > On Dec 15, 2007 7:19 AM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
> > > Hmm, this is interesting. Singular may be frightening for factoring with
> > > some
On Sat, Dec 15, 2007 at 11:12:12AM -0800, William Stein wrote:
> On Dec 15, 2007 7:19 AM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
> > Hmm, this is interesting. Singular may be frightening for factoring with
> > some
> > big bad examples, but it seems we've got some work to do for the small
>
On Dec 15, 2007 7:19 AM, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
>
> Hmm, this is interesting. Singular may be frightening for factoring with some
> big bad examples, but it seems we've got some work to do for the small cases.
> sage: R.=QQ[] # singular
> sage: r=y^37-1
> sage: timeit r.factor(
