{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:05:53Z","timestamp":1753887953153,"version":"3.41.2"},"reference-count":24,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,6,7]],"date-time":"2021-06-07T00:00:00Z","timestamp":1623024000000},"content-version":"vor","delay-in-days":157,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871207"],"award-info":[{"award-number":["11871207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>The GVW algorithm is an effective algorithm to compute Gr\u00f6bner 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\u00f6bner bases for polynomial ideals over valuation domains in this study. Furthermore, we use an example to demonstrate the improvement of our algorithm.<\/jats:p>","DOI":"10.1155\/2021\/7010413","type":"journal-article","created":{"date-parts":[[2021,6,7]],"date-time":"2021-06-07T20:38:13Z","timestamp":1623098293000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Extension of the GVW Algorithm to Valuation Domains"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3444-8861","authenticated-orcid":false,"given":"Dongmei","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1375-287X","authenticated-orcid":false,"given":"Licui","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,6,7]]},"reference":[{"key":"e_1_2_9_1_2","unstructured":"BuchbergerB. An algorithm for finding a basis for the redidue class ring of a zero dimensiomal polynomial 1965 Universit\u00e4t Innsbruck Institut f\u00fcr Mathematik Innsbruck Austria Ph. D. thesis."},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11045-015-0329-4"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.11.030"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.10.031"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2019.06.036"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.04.051"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cta.2020.0110"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/rnc.4975"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.nahs.2020.100883"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2020.12.002"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2019.09.001"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2018.11.017"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125432"},{"key":"e_1_2_9_14_2","doi-asserted-by":"crossref","unstructured":"BuchbergerB. A criterion for detecting unnecessary reductions in the construction of Gr\u00f6bner bases EUROSAM\u201979: Proceedings of the International Symposiumon on Symbolic and Algebraic Computation June 1979 Marseille France 3\u201321.","DOI":"10.1007\/3-540-09519-5_52"},{"volume-title":"An Algorithmic Method in Polynomial Ideal Theory","year":"1985","author":"Gr\u00f6bner-Bases B. B..","key":"e_1_2_9_15_2"},{"key":"e_1_2_9_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_27"},{"key":"e_1_2_9_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.06.019"},{"key":"e_1_2_9_18_2","unstructured":"SunY.andWangD. F5B: A new proof of the F5 algorithm 2010 http:\/\/arxiv.org\/abs\/1004.0084."},{"key":"e_1_2_9_19_2","unstructured":"FaugereJ. C. A new effcient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5) ISSAC 02: Proceedings of the 2002 International Symposium on Symbolic and algebraic computation July 2002 Lille France 75\u201383."},{"key":"e_1_2_9_20_2","doi-asserted-by":"crossref","unstructured":"GaoS. GuanY. andVolnyF. A new incremental algorithm for computing Gr\u00f6bner bases ISSAC 10: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation July 2010 M\u00fcnchen Germany 13\u201319.","DOI":"10.1145\/1837934.1837944"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/2969"},{"key":"e_1_2_9_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2017.04.015"},{"key":"e_1_2_9_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11424-013-2130-5"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11424-020-9135-7"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/7010413.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/7010413.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/7010413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T23:13:32Z","timestamp":1723245212000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/7010413"}},"subtitle":[],"editor":[{"given":"Hou-Sheng","family":"Su","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/7010413"],"URL":"https:\/\/doi.org\/10.1155\/2021\/7010413","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-04-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-24","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-06-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"7010413"}}