CSpace  > 系统科学研究所
The F5 algorithm in Buchberger's style
Sun, Yao; Wang, Dingkang
2011-12-01
发表期刊JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY
ISSN1009-6124
卷号24期号:6页码:1218-1231
摘要The famous F5 algorithm for computing Grobner basis was presented by FaugSre in 2002. The original version of F5 is given in programming codes, so it is a bit difficult to understand. In this paper, the F5 algorithm is simplified as F5B in a Buchberger's style such that it is easy to understand and implement. In order to describe F5B, we introduce F5-reduction, which keeps the signature of labeled polynomials unchanged after reduction. The equivalence between F5 and F5B is also shown. At last, some versions of the F5 algorithm are illustrated.
关键词Buchberger's style F5 algorithm Grobner basis
DOI10.1007/s11424-011-0218-3
语种英语
资助项目NKBRPC[2011CB302400] ; NSFC[10971217] ; NSFC[60821002/F02]
WOS研究方向Mathematics
WOS类目Mathematics, Interdisciplinary Applications
WOS记录号WOS:000297798800015
出版者SPRINGER HEIDELBERG
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/11607
专题系统科学研究所
通讯作者Sun, Yao
作者单位Chinese Acad Sci, Acad Math & Syst Sci, Key Lab Math Mechanizat, Beijing 100190, Peoples R China
推荐引用方式
GB/T 7714
Sun, Yao,Wang, Dingkang. The F5 algorithm in Buchberger's style[J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY,2011,24(6):1218-1231.
APA Sun, Yao,&Wang, Dingkang.(2011).The F5 algorithm in Buchberger's style.JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY,24(6),1218-1231.
MLA Sun, Yao,et al."The F5 algorithm in Buchberger's style".JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY 24.6(2011):1218-1231.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Sun, Yao]的文章
[Wang, Dingkang]的文章
百度学术
百度学术中相似的文章
[Sun, Yao]的文章
[Wang, Dingkang]的文章
必应学术
必应学术中相似的文章
[Sun, Yao]的文章
[Wang, Dingkang]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。