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.
