Tereso del Río, AmirHosein Sadeghimanesh, Matthew England
{"title":"拉扎德圆柱代数分解法中的聚类方法","authors":"Tereso del Río, AmirHosein Sadeghimanesh, Matthew England","doi":"10.1145/3637529.3637533","DOIUrl":null,"url":null,"abstract":"Cylindrical Algebraic Decomposition (CAD) is an algorithm originally proposed by Collins in [4]. Given a set of multivariate polynomials, CAD decomposes the multidimensional real space into connected subsets called cells, within which those polynomials are sign-invariant.","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"24 1","pages":"126 - 132"},"PeriodicalIF":0.4000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Clustering in the Lazard method for Cylindrical Algebraic Decomposition\",\"authors\":\"Tereso del Río, AmirHosein Sadeghimanesh, Matthew England\",\"doi\":\"10.1145/3637529.3637533\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cylindrical Algebraic Decomposition (CAD) is an algorithm originally proposed by Collins in [4]. Given a set of multivariate polynomials, CAD decomposes the multidimensional real space into connected subsets called cells, within which those polynomials are sign-invariant.\",\"PeriodicalId\":41965,\"journal\":{\"name\":\"ACM Communications in Computer Algebra\",\"volume\":\"24 1\",\"pages\":\"126 - 132\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Communications in Computer Algebra\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3637529.3637533\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Communications in Computer Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3637529.3637533","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Clustering in the Lazard method for Cylindrical Algebraic Decomposition
Cylindrical Algebraic Decomposition (CAD) is an algorithm originally proposed by Collins in [4]. Given a set of multivariate polynomials, CAD decomposes the multidimensional real space into connected subsets called cells, within which those polynomials are sign-invariant.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
