GVW ALGORITHM OVER PRINCIPAL IDEAL DOMAINS

doi:10.1007/s11424-013-2130-5

PDF(163 KB)

Journal of Systems Science & Complexity ›› 2013, Vol. 26 ›› Issue (4) : 619-633. DOI: 10.1007/s11424-013-2130-5

article

GVW ALGORITHM OVER PRINCIPAL IDEAL DOMAINS

LI Dongmei ¹, LIU Jinwang² , LIU Weijun³ , ZHENG Licui³

Author information +

History +

Abstract

GVW algorithm was given by Gao, Wang, and Volny in computing a Grobner bases for ideal in a polynomial ring, which is much faster and more simple than F5. In this paper, the authors generalize GVW algorithm and present an algorithm to compute a Grobner bases for ideal when the coecient ring is a principal ideal domain.

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations

LI Dongmei , LIU Jinwang , LIU Weijun , ZHENG Licui. GVW ALGORITHM OVER PRINCIPAL IDEAL DOMAINS. Journal of Systems Science and Complexity, 2013, 26(4): 619-633 https://doi.org/10.1007/s11424-013-2130-5

Funding

This research was supported by the National Natural Science Foundation of China under Grant Nos. 11071062,11271208, and Scientic Research Fund of Hunan Province Education Department under Grant Nos. 10A033,12C0130.

PDF(163 KB)

157

Accesses

Citation

Detail

Sections

Recommended

Abstract
Cite this article
Funding

Received	Published
2012-06-26	2013-08-25
Issue Date
2013-08-20

Please choose a citation manager

Content to export

Abstract

Cite this article

{{custom_sec.title}}

{{custom_sec.title}}

{{custom_fnGroup.title_en}}

Footnotes

Funding

扫码分享

模态框（Modal）标题

Please choose a citation manager

Content to export

Abstract

Cite this article

{{custom_sec.title}}

{{custom_sec.title}}

{{custom_fnGroup.title_en}}

Footnotes

Funding