比较各种消切方法的复杂性

{"title":"比较各种消切方法的复杂性","authors":"M. Baaz, A. Leitsch","doi":"10.1007/3-540-45504-3_4","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":226486,"journal":{"name":"Proof Theory in Computer Science","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Comparing the Complexity of Cut-Elimination Methods\",\"authors\":\"M. Baaz, A. Leitsch\",\"doi\":\"10.1007/3-540-45504-3_4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":226486,\"journal\":{\"name\":\"Proof Theory in Computer Science\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proof Theory in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/3-540-45504-3_4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proof Theory in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-45504-3_4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}