The A-hierarchy is a parametric analogue of the polynomial hierarchy in the context of parameterised complexity theory. We give a new characterisation of the A-hierarchy in terms of a generalisation of the SUBSET-SUM problem.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A SUBSET-SUM Characterisation of the A-Hierarchy

  • Jan Gutleben,
  • Arne Meier

摘要

The A-hierarchy is a parametric analogue of the polynomial hierarchy in the context of parameterised complexity theory. We give a new characterisation of the A-hierarchy in terms of a generalisation of the SUBSET-SUM problem.