asurveyonalgorithmsforcomputingcomprehensivegrobnersystemsandcomprehensivegrobnerbases

CSpace > 系统科学研究所

	asurveyonalgorithmsforcomputingcomprehensivegrobnersystemsandcomprehensivegrobnerbases
	Lu Dong 1; Sun Yao 2; Wang Dingkang1
	2019
发表期刊	journalofsystemsscienceandcomplexity
ISSN	1009-6124
卷号	32 期号:1 页码:234
摘要	Weispfenning 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.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/48641
专题	系统科学研究所
作者单位	1.中国科学院数学与系统科学研究院 2.中国科学院信息工程研究所
推荐引用方式 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.