On Tuesday 01 December 2009, Simon King wrote: > Hi Martin! > > On 1 Dez., 19:02, Martin Albrecht <m...@informatik.uni-bremen.de> > > wrote: > > Hi there, > > > > the following code is really, really really (REALLY!) slow: > > Well, the default implementation creates a polynomial ring with 10000 > variables in the background when you say x[10000], and another ring > with 10001 variables if you then say x[10001].
Sure, but up to 50 seconds for a simple coercion seems way way too much even in that case. Martin -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF _www: http://www.informatik.uni-bremen.de/~malb _jab: martinralbre...@jabber.ccc.de -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
