I only skimmed into this thread from a discussion on theano-dev (which I was, in turn, only casually following). So, my comment may be meaningless.
But one thought I had was can you prevent some of the combinatorial blowup by asserting (or converting) to canonical form before applying rewrite rules? [Perhaps you have cases where you specifically want arbitrarily ordered expressions written to other (arbitrarily ordered) expressions.] Again, possibly just a stray thread. Best, Mark On Friday, November 2, 2012 5:48:10 PM UTC-4, smichr wrote: > > OK. Then see http://tinyurl.com/bgklazd again for the updated > algorithm. Note that the ordered=None case is reported as lists of > lists but they should be thought of as sets of sets. > -- You received this message because you are subscribed to the Google Groups "sympy" group. To view this discussion on the web visit https://groups.google.com/d/msg/sympy/-/WaYFHoReKnIJ. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
