CSpace
On the complexity of computing real radicals of polynomial systems
El Din, Mohab Safey; Yang, Zhi-Hong; Zhi, Lihong
2018
Source PublicationISSAC'18: PROCEEDINGS OF THE 2018 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION
Pages351
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/33943
Collection中国科学院数学与系统科学研究院
Recommended Citation
GB/T 7714
El Din, Mohab Safey,Yang, Zhi-Hong,Zhi, Lihong. On the complexity of computing real radicals of polynomial systems[J]. ISSAC'18: PROCEEDINGS OF THE 2018 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION,2018:351.
APA El Din, Mohab Safey,Yang, Zhi-Hong,&Zhi, Lihong.(2018).On the complexity of computing real radicals of polynomial systems.ISSAC'18: PROCEEDINGS OF THE 2018 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION,351.
MLA El Din, Mohab Safey,et al."On the complexity of computing real radicals of polynomial systems".ISSAC'18: PROCEEDINGS OF THE 2018 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION (2018):351.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[El Din, Mohab Safey]'s Articles
[Yang, Zhi-Hong]'s Articles
[Zhi, Lihong]'s Articles
Baidu academic
Similar articles in Baidu academic
[El Din, Mohab Safey]'s Articles
[Yang, Zhi-Hong]'s Articles
[Zhi, Lihong]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[El Din, Mohab Safey]'s Articles
[Yang, Zhi-Hong]'s Articles
[Zhi, Lihong]'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.