Institutional Repository
| 基于ZBDD的布尔多项式Grobner基算法的实现 | |
| Alternative Title | implementing zbdd-based grobner basis algorithm of boolean polynomials |
| 李昕; 张寅 | |
| 2011 | |
| Source | Computer Applications and Software
 |
| ISSN | 1000-386X |
| Volume | 28Issue:2 |
| English Abstract | 零压缩二元判定树ZBDD(Zero-suppressed Binary Decision Diagrams)作为一种近年来兴起的存储布尔多项式的数据结构能更有效地平衡内存消耗与计算速度;基于它的布尔多项式Grobner基算法可以在运算 中保持ZBDD结构的不变性从而进一步提高计算效率。用C+ +实现了布尔多项式的Grobner基计算并对其进行既约化处理,验证了该算法的可行性以及在运算效率上的提高。 |
| Indexed Type | CSCD |
| Abstract | As a rising data structure storing Boolean polynomial in recent years, ZBDD (zero suppressed binary decision diagram) enables more efficient computing speed and more balanced memory consumption.The Gr?bner basis algorithm of Boolean polynomial based on it can maintain ZBDD structure unchanged so as to further enhance the efficiency of computations. In this paper, we use C + + to achieve the Boolean polynomials Gr?bner-basis computation with the irreducibility processing on Gr?bner basis,and the feasibility of the algorithm as well as the improvement on efficiency of the operations are verified as well. |
| Keyword | Grobner基 |
| Department | 李昕 （徐州）中国矿业大学计算机学院 徐州 江苏 221008 中国. 张寅 中国科学院软件研究所 北京 100080 中国. |
| Subject | Automation & Control Systems |
| Sponsorship | 中国矿业大学青年科研基金项目 |
| Language | 中文 |
| CSCD ID | CSCD:4377947 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16146 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | 李昕,张寅. 基于ZBDD的布尔多项式Grobner基算法的实现[J]. Computer Applications and Software,2011,28(2). |
| APA | 李昕,&张寅.(2011).基于ZBDD的布尔多项式Grobner基算法的实现.Computer Applications and Software,28(2). |
| MLA | 李昕,et al."基于ZBDD的布尔多项式Grobner基算法的实现".Computer Applications and Software 28.2(2011). |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment