This problem is easy to solve if the algorithm consists of many small transformations. I suggest looking at recent work by @pernici and @smichr on trigsimp
I think they're working off of this article http://rfdz.ph-noe.ac.at/fileadmin/Mathematik_Uploads/ACDCA/DESTIME2006/DES_contribs/Fu/simplification.pdf Similarly this project is trivial in MatrixExprs, which also uses many small transformation rules. On Fri, Feb 1, 2013 at 3:21 AM, Christophe BAL <[email protected]> wrote: > Be carefull because some problems are hard to solve in their general > forms. I'm thinking about SAT-problem which is known to be NP-complete : > see this page<http://en.wikipedia.org/wiki/Boolean_satisfiability_problem>. > > > -- > 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?hl=en. > 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?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
