{"title":"An isomorphism between subexponential and parameterized complexity theory","authors":"Yijia Chen, Martin Grohe","doi":"10.1137/070687153","DOIUrl":null,"url":null,"abstract":"We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preserving isomorphism between the two theories","PeriodicalId":325664,"journal":{"name":"21st Annual IEEE Conference on Computational Complexity (CCC'06)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st Annual IEEE Conference on Computational Complexity (CCC'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/070687153","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16
Abstract
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preserving isomorphism between the two theories
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
