Thanks for the hint mario. I could find the source already implemented. Could you please clarify me the following questions too. 1. If the F4 is to be implemented should it use the *F5 algorithm* as well to assist in computing the Groebner basis? 2. From the *efficiency* point of view the F4 oversteps all other reduction algorithms and do we still need other algorithms in the system? 2. Is there a *precision limit* enforced as sparse matrices involve with the computations?
Thank you. Regards, Zamrath Nizam -- 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.
