降低Knuth-Bendix补全算法的复杂性:不同方法的“统一”

{"title":"降低Knuth-Bendix补全算法的复杂性:不同方法的“统一”","authors":"F. Winkler","doi":"10.1007/3-540-15984-3_293","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":412002,"journal":{"name":"European Conference on Computer Algebra","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1985-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Reducing the Complexity of the Knuth-Bendix Completion-Algorithm: A \\\"Unification\\\" of Different Approaches\",\"authors\":\"F. Winkler\",\"doi\":\"10.1007/3-540-15984-3_293\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":412002,\"journal\":{\"name\":\"European Conference on Computer Algebra\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Conference on Computer Algebra\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/3-540-15984-3_293\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Conference on Computer Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-15984-3_293","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}