I don't think so, but I never work over the boolean ring so I am not sure if there is different theory for that. In general I think Groebner basis computations have nasty complexity (doubly exponential worst case?) in the number of variables and degree, so tripling the number of variables potentially could really blow things up. Over QQ, which is what I work with, I definitely see that sort of blow-up in practice.
-M. Hampton On Jun 24, 10:20 am, vpv <un3_14ql...@yahoo.com> wrote: > I have a system of 300 quadratic boolean equations in 200 variables. I > am able to find a single solution to the system using Groebner Bases > (the PolyBori implementation) in time less than 2 minutes - 1 second > for computing the Groebner Basis and 85 seconds for computing the > variety and memory around 2 GB. > > My question is this: based on the above information, is it possible to > evaluate what would be the time and memory to solve a system of three > times bigger size (900 equations in 600 variables) assuming that the > algebraic structure of the big system remains similar to the small > system? --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
