S. Schmitz
{"title":"Complexity Bounds for Ordinal-Based Termination - (Invited Talk)","authors":"S. Schmitz","doi":"10.1007/978-3-319-11439-2_1","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Reachability Problems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-11439-2_1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
