KMS Of Academy of mathematics and systems sciences, CAS
| asurveyonalgorithmsforcomputingcomprehensivegrobnersystemsandcomprehensivegrobnerbases | |
Lu Dong1; Sun Yao2; Wang Dingkang1
| |
| 2019 | |
| Source Publication | journalofsystemsscienceandcomplexity
 |
| ISSN | 1009-6124 |
| Volume | 32Issue:1Pages:234 |
| Abstract | 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. |
| Language | 英语 |
| Document Type | 期刊论文 |
| Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/48641 |
| Collection | 系统科学研究所 |
| Affiliation | 1.中国科学院数学与系统科学研究院 2.中国科学院信息工程研究所 |
| 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. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment