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 条
  • [1] Role of involutive criteria in computing Boolean Gröbner bases
    V. P. Gerdt
    M. V. Zinin
    Programming and Computer Software, 2009, 35 : 90 - 97
  • [2] Involutive algorithms for computing Grobner bases
    Gerdt, VP
    Computational Commutative and Non-Commutative Algebraic Geometry, 2005, 196 : 199 - 225
  • [3] Grobner bases and involutive bases
    Astrelin, AV
    Golubitsky, OD
    Pankratiev, EV
    ALGEBRA, 2000, : 49 - 55
  • [4] Compact representation of polynomials for algorithms for computing Grobner and involutive bases
    Yanovich, D. A.
    PROGRAMMING AND COMPUTER SOFTWARE, 2015, 41 (02) : 126 - 130
  • [5] Computing Grobner and Involutive Bases for Linear Systems of Difference Equations
    Yanovich, Denis
    MATHEMATICAL MODELING AND COMPUTATIONAL PHYSICS 2017 (MMCP 2017), 2018, 173
  • [6] A GROBNER APPROACH TO INVOLUTIVE BASES
    APEL, J
    JOURNAL OF SYMBOLIC COMPUTATION, 1995, 19 (05) : 441 - 457
  • [7] Involutive method for computing Grobner bases over F2
    Gerdt, V. P.
    Zinin, M. V.
    PROGRAMMING AND COMPUTER SOFTWARE, 2008, 34 (04) : 191 - 203
  • [8] Boolean Grobner bases
    Sato, Yosuke
    Inoue, Shutaro
    Suzuki, Akira
    Nabeshima, Katsusuke
    Sakai, Ko
    JOURNAL OF SYMBOLIC COMPUTATION, 2011, 46 (05) : 622 - 632
  • [9] A pommaret division algorithm for computing grobner bases in boolean rings
    Gerdt, Vladimir P.
    Zinin, Mikhail V.
    Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, 2008,
  • [10] On computation of Boolean involutive bases
    V. P. Gerdt
    M. V. Zinin
    Yu. A. Blinkov
    Programming and Computer Software, 2010, 36 : 117 - 123
12345