Oh wow... so there's a possibility that the calculation might take million of years for what I'm trying to do? Or there some easy way to approximate how long it will take based off of how many variables I have? Thank you!
-Saad On Wednesday, March 30, 2016 at 2:35:07 PM UTC-5, mmarco wrote: > > All known gröbner basis algorithms have double exponential complexity. It > means that the time you would need to complete a computation grows very > quickly when you move to a high number of variables. It is not surprising > at all that it may take days or even much more (think of millions of years) > for big inputs like yours. > > > -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
