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 -~----------~----~----~----~------~----~------~--~---
