CSpace  > 系统科学研究所
Lu Dong1; Sun Yao2; Wang Dingkang1
Source Publicationjournalofsystemsscienceandcomplexity
AbstractWeispfenning in 1992 introduced the concepts of comprehensive Grobner system/basis of a parametric polynomial system, and he also presented an algorithm to compute them. Since then, this research field has attracted much attention over the past several decades, and many efficient algorithms have been proposed. Moreover, these algorithms have been applied to many different fields, such as parametric polynomial equations solving, geometric theorem proving and discovering, quantifier elimination, and so on. This survey brings together the works published between 1992 and 2018, and we hope that this survey is valuable for this research area.
Document Type期刊论文
Recommended Citation
GB/T 7714
Lu Dong,Sun Yao,Wang Dingkang. asurveyonalgorithmsforcomputingcomprehensivegrobnersystemsandcomprehensivegrobnerbases[J]. journalofsystemsscienceandcomplexity,2019,32(1):234.
APA Lu Dong,Sun Yao,&Wang Dingkang.(2019).asurveyonalgorithmsforcomputingcomprehensivegrobnersystemsandcomprehensivegrobnerbases.journalofsystemsscienceandcomplexity,32(1),234.
MLA Lu Dong,et al."asurveyonalgorithmsforcomputingcomprehensivegrobnersystemsandcomprehensivegrobnerbases".journalofsystemsscienceandcomplexity 32.1(2019):234.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Lu Dong]'s Articles
[Sun Yao]'s Articles
[Wang Dingkang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Lu Dong]'s Articles
[Sun Yao]'s Articles
[Wang Dingkang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Lu Dong]'s Articles
[Sun Yao]'s Articles
[Wang Dingkang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.