Hi Francesco, thanks for your response. The Rubi implementation looks very interesting, also the paper about matching algorithms. I will definitely take a close look at that.
What is your feeling about how the Rubi implementation turned out overall? Did you run into any roadblocks on the way? Do you think the general approach can be extended in a straightforward way to all of Rubi? If not, what are the large-scale changes that you foresee? Is it known how the time required to process an expression with this implementation varies as a function of the number of rules? Is it known whether the time is linear in the number of rules, or perhaps logarithmic or something else? Thanks for any remarks you might have on this subject. best, Robert Dodier -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to sympy+unsubscr...@googlegroups.com. To post to this group, send email to sympy@googlegroups.com. Visit this group at https://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/6b3775b1-bd72-4de0-ae8e-a98a7c20b4ce%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
