Post new topic Reply to topic  [ 2 posts ] 
Author Message
 Post subject: Command for Groebner bases of Hidden Field Equations
PostPosted: Wed Aug 01, 2012 7:11 am 
Which command should be used for getting the best performance for computing Groebner bases of Hidden Field Equations (HFE) ? I tried "groebner" and "std", both seem to be giving the same performance.

Thanks,
Yashodhan Karandikar


Report this post
Top
  
Reply with quote  
 Post subject: Re: Command for Groebner bases of Hidden Field Equations
PostPosted: Wed Aug 01, 2012 3:03 pm 

Joined: Thu Mar 04, 2010 1:29 pm
Posts: 14
Singular's std command is just one among others (see, e.g., slimgb, stdhilb, fglm, modStd, ...) to compute Gröbner bases. It is in principle based on Buchberger's algorithm. In contrast to this, the groebner command heuristically chooses one method that is known to be fast in most such cases.

So maybe you get similar timings for std and groebner in your case because groebner in fact calls std.

Note that the relatively new command modStd (from modstd.lib), which makes use of parallelization, is not yet included in groebner, so it might be worth trying this.

Best regards,
Andreas


Report this post
Top
 Profile  
Reply with quote  
Display posts from previous:  Sort by  
Post new topic Reply to topic  [ 2 posts ] 

You can post new topics in this forum
You can reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum

It is currently Fri May 13, 2022 11:05 am
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group