{"title":"Scheduling Complexity of Interleaving Search","authors":"Dmitry Rozplokhas, Dmitry Boulytchev","doi":"10.1007/978-3-030-99461-7_9","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":258363,"journal":{"name":"Fuji International Symposium on Functional and Logic Programming","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fuji International Symposium on Functional and Logic Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-99461-7_9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
