Comment #4 on issue 2236 by [email protected]: solve fails for polysys with multiple solutions
http://code.google.com/p/sympy/issues/detail?id=2236
I don't know right now about any algorithm that could solve this problem systematically (as we can in zero-dimensional case) and could be implemented in a reasonable time horizon. I know that cylindrical algebraic decomposition could help here, but this algorithm behaves even worse (in terms of complexity) than Groebner bases and is "a little" more complicated to implement.
-- You received this message because you are subscribed to the Google Groups "sympy-issues" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sympy-issues?hl=en.
