Role of Involutive Criteria in Computing Boolean Grobner Bases

被引：0
|
作者：
Gerdt, V. P. [1 ]
Zinin, M. V. [1 ]
机构：
[1] Joint Inst Nucl Res, Informat Technol Lab, Dubna 141980, Moscow Oblast, Russia
来源：
PROGRAMMING AND COMPUTER SOFTWARE | 2009年 / 35卷 / 02期
基金：
俄罗斯基础研究基金会;
关键词：
19;
D O I：
10.1134/S0361768809020042
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In this paper, effectiveness of using four criteria in an involutive algorithm based on the Pommaret division for construction of Boolean Grobner bases is studied. One of the results of this study is the observation that the role of the criteria in computations in Boolean rings is much less than that in computations in an ordinary ring of polynomials over the field of integers. Another conclusion of this study is that the efficiency of the second and/or third criteria is higher than that of the two others.
引用
收藏
页码：90 / 97
页数：8
相关论文
共 50 条
  • [41] An efficient method for computing comprehensive Grobner bases
    Kapur, Deepak
    Sun, Yao
    Wang, Dingkang
    JOURNAL OF SYMBOLIC COMPUTATION, 2013, 52 : 124 - 142
  • [42] APPLYING BUCHBERGER'S CRITERIA FOR COMPUTING GROBNER BASES OVER FINITE-CHAIN RINGS
    Hashemi, Amir
    Alvandi, Parisa
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2013, 12 (07)
  • [43] Extending Clause Learning of SAT Solvers with Boolean Grobner Bases
    Zengler, Christoph
    Kuechlin, Wolfgang
    COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, 2010, 6244 : 293 - 302
  • [44] Effectiveness of involutive criteria in computation of polynomial Janet bases
    Gerdt, V. P.
    Yanovich, D. A.
    PROGRAMMING AND COMPUTER SOFTWARE, 2006, 32 (03) : 134 - 138
  • [45] Effectiveness of involutive criteria in computation of polynomial Janet bases
    V. P. Gerdt
    D. A. Yanovich
    Programming and Computer Software, 2006, 32 : 134 - 138
  • [46] Multiplicative bases, Grobner bases, and right Grobner bases
    Green, EL
    JOURNAL OF SYMBOLIC COMPUTATION, 2000, 29 (4-5) : 601 - 623
  • [47] An Extended S-polynomial for Computing Grobner Bases
    He, Jinao
    Zhong, Xiuqin
    2013 2ND INTERNATIONAL SYMPOSIUM ON INSTRUMENTATION AND MEASUREMENT, SENSOR NETWORK AND AUTOMATION (IMSNA), 2013, : 738 - 740
  • [48] ON THE COMPLEXITY OF COMPUTING GROBNER BASES IN CHARACTERISTIC-2
    ACCIARO, V
    INFORMATION PROCESSING LETTERS, 1994, 51 (06) : 321 - 323
  • [49] Computing strong regular characteristic pairs with Grobner bases
    Dong, Rina
    Wang, Dongming
    JOURNAL OF SYMBOLIC COMPUTATION, 2021, 104 : 312 - 327
  • [50] On the complexity of computing Grobner bases for weighted homogeneous systems
    Faugere, Jean-Charles
    El Din, Mohab Safey
    Verron, Thibaut
    JOURNAL OF SYMBOLIC COMPUTATION, 2016, 76 : 107 - 141
12345