布尔多项式环上分支Gröbner基算法的实现及复杂度分析

{"title":"布尔多项式环上分支Gröbner基算法的实现及复杂度分析","authors":"Yao Sun, Dingkang Wang","doi":"10.1007/978-3-662-43799-5_14","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":206437,"journal":{"name":"Asian Symposium on Computer Mathematics","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Implementation and Complexity Analysis of the Branch Gröbner Bases Algorithm Over Boolean Polynomial Rings\",\"authors\":\"Yao Sun, Dingkang Wang\",\"doi\":\"10.1007/978-3-662-43799-5_14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":206437,\"journal\":{\"name\":\"Asian Symposium on Computer Mathematics\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Asian Symposium on Computer Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-662-43799-5_14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asian Symposium on Computer Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-662-43799-5_14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}