A SUBSET-SUM Characterisation of the A-Hierarchy
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912024796069888 |
|---|---|
| author | Gutleben, Jan Meier, Arne |
| author_facet | Gutleben, Jan Meier, Arne |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_07996 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A SUBSET-SUM Characterisation of the A-Hierarchy Gutleben, Jan Meier, Arne Logic in Computer Science Computational Complexity 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. |
| title | A SUBSET-SUM Characterisation of the A-Hierarchy |
| topic | Logic in Computer Science Computational Complexity |
| url | https://arxiv.org/abs/2409.07996 |