On Feb 5, 6:07 am, Martin Albrecht <m...@informatik.uni-bremen.de>
wrote:
> On Thursday 05 February 2009, Adela wrote:
<SNIP>
> > As you said, the computations should not take so long because I work
> > in the ring Z / 2 so I have as solutions only 1 and 0 (they represent
> > bits).
>
> Well since you have 61 variables not so long means O(2^61) in the worst case.
> You can't really know a priori.
It would also be interesting to know how much RAM your system has and
if the computation you run over night ever hit swap since it is
basically game over once you hit swap in a GB computation :)
I don't know if PolyBoRi has some kind of verbosity option that tells
you what is going on so that you can at least have an idea if the
computation has a chance to finish.
> Martin
As others have pointed out above GBasis computation is pretty
difficult and a dark art, i.e. with some systems you can run the
computation, inspect the elements of the Gbasis that were already
found and add "good" ones back into the ideal and restart the
computation from scratch. I am not aware how you can do that with
either Singular or PolyBoRi, but I did such computations back in 2007
with a customized version of CoCoALib.
Cheers,
Michael
> --
> name: Martin Albrecht
> _pgp:http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
> _otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
> _www:http://www.informatik.uni-bremen.de/~malb
> _jab: martinralbre...@jabber.ccc.de
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
