Sure. But I think (possibly contrary to what I said earlier), staircase
really isn't the problem. If the result is huge then the next parts (calling
reduced(), solving the linear system) are going to take ages as well.
Maybe we should run kernprof on it to see what function calls are
really taking up the most time.
I'm using mprofile. But it's not all that easy to decipher where the
problem is (even from a nice graph *g*), or if there even is a real
problem (an algorithm that suffers combinatorial explosion simply is not
going to work with large expressions...).
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to sympy@googlegroups.com.
To unsubscribe from this group, send email to
sympy+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/sympy?hl=en.
