I'm looking at implementing a matching algorithm that requires the solution of linear diophantine equations. My understanding is that we don't have support for this. How challenging are algorithms for the solution of diophantine equations? I'm trying to gauge the cost of pursuing my current path.
-- 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.
