The Extension of the GVW Algorithm to Valuation Domains

Dongmei Li, Licui Zheng and Hou-Sheng Su

Complexity, 2021, vol. 2021, 1-8

Abstract: The GVW algorithm is an effective algorithm to compute Gröbner bases for polynomial ideals over a field. Combined with properties of valuation domains and the idea of the GVW algorithm, we propose a new algorithm to compute Gröbner bases for polynomial ideals over valuation domains in this study. Furthermore, we use an example to demonstrate the improvement of our algorithm.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/7010413.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/7010413.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:7010413

DOI: 10.1155/2021/7010413

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().