I need to solve a big system of nonlinear equations(it consists of 114 equations, with 61 indeterminates, all of them can be only 0 and 1 and I work modulo 2).
I solve it using Groebner bases. So, my problem coms to finding the reduced Groebner base for an ideal generated by 114 polynomials. Can you tell me if Sage can face it, or approximatively how long would take to do that? I'm afraid only of a crush; I can wait long, it's not so important, if in the end I have a result. Thank you! --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
