首页> 外文会议>Computer mathematics >On the Computation of Elimination Ideals of Boolean Polynomial Rings
【24h】

On the Computation of Elimination Ideals of Boolean Polynomial Rings

机译:关于布尔多项式环的消除理想的计算

获取原文
获取原文并翻译 | 示例

摘要

In order to compute an eliminate portion of a given polynomial ideal by a Grobner basis computation, we usually need to compute a Grobner basis of the whole ideal with respect to some proper term order. In a boolean polynomial ring, we show that we can compute an eliminate portion by computing Grobner bases in the boolean polynomial ring with the same coefficient ring that has the only variables which we want to eliminate. We also check the efficiency of our method through our implementation.
机译:为了通过Grobner基计算来计算给定多项式理想的消除部分,我们通常需要针对某个适当的项阶计算整个理想的Grobner基。在布尔多项式环中,我们证明了可以通过计算布尔多项式环中的Grobner基来计算消除部分,该Grobner基具有相同的系数环,该环具有我们要消除的唯一变量。我们还将通过实施来检查方法的效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号