A SUBSET-SUM Characterisation of the A-Hierarchy
Logic in Computer Science
2024-09-13 v1 Computational Complexity
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.
Cite
@article{arxiv.2409.07996,
title = {A SUBSET-SUM Characterisation of the A-Hierarchy},
author = {Jan Gutleben and Arne Meier},
journal= {arXiv preprint arXiv:2409.07996},
year = {2024}
}