Sophisticated algorithms for pattern matching against a large collection of potentially associative-commutative terms can be both very involved/challenging and also be vastly more efficient than naive algorithms.
Optimization on this problem over algorithms is more effective than optimization over language-implementations and as such the performance advantages of C++ over Python are negligible. On Mon, Sep 30, 2013 at 12:09 PM, someone <[email protected]> wrote: > Hi, > > > > CSymPy is written in C++, so my goal is for the pattern matching to > > be as fast as in Mathematica. > > Oh, maybe my formulation was misleading and confused two things. > > First is python vs C++ or any interpreted vs compiled language. > I don't want to start another discussion on pros and cons here. > > The other thing is that the Risch algorithm is very complex, having > a recursive nature and many computationally intensive steps. > > Searching a (well organized!) table of rules might be faster > in most cases. It depends strongly on how we search and match. > > -- > 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 [email protected]. > To post to this group, send email to [email protected]. > Visit this group at http://groups.google.com/group/sympy. > For more options, visit https://groups.google.com/groups/opt_out. > -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sympy. For more options, visit https://groups.google.com/groups/opt_out.
