{"title":"A SUBSET-SUM Characterisation of the A-Hierarchy","authors":"Jan Gutleben, Arne Meier","doi":"arxiv-2409.07996","DOIUrl":null,"url":null,"abstract":"The A-hierarchy is a parametric analogue of the polynomial hierarchy in the\ncontext of paramterised complexity theory. We give a new characterisation of\nthe A-hierarchy in terms of a generalisation of the SUBSET-SUM problem.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"10 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07996","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The A-hierarchy is a parametric analogue of the polynomial hierarchy in the
context of paramterised complexity theory. We give a new characterisation of
the A-hierarchy in terms of a generalisation of the SUBSET-SUM problem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
