{"title":"On the Complexity of the Groebner-Bases Algorithm over K[x, y, z]","authors":"F. Winkler","doi":"10.1007/BFb0032841","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":229522,"journal":{"name":"Symbolic and Algebraic Computation","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1984-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/BFb0032841","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
