单项式比较的复杂性及Buchberger-Möller算法的两种改进

{"title":"单项式比较的复杂性及Buchberger-Möller算法的两种改进","authors":"S. Lundqvist","doi":"10.1007/978-3-540-89994-5_9","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":332329,"journal":{"name":"Mathematical Methods in Computer Science","volume":"771 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm\",\"authors\":\"S. Lundqvist\",\"doi\":\"10.1007/978-3-540-89994-5_9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":332329,\"journal\":{\"name\":\"Mathematical Methods in Computer Science\",\"volume\":\"771 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Methods in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-540-89994-5_9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Methods in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-540-89994-5_9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}