A Complexity Theory for Hard Enumeration Problems
Computational Complexity
2017-10-25 v2
Abstract
Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enumeration problems, the tools provided by complexity theory for this important class of problems are very limited. In particular, complexity classes analogous to the polynomial hierarchy and an appropriate notion of problem reduction are missing. In this work, we lay the foundations for a complexity theory of hard enumeration problems by proposing a hierarchy of complexity classes and by investigating notions of reductions for enumeration problems.
Cite
@article{arxiv.1610.05493,
title = {A Complexity Theory for Hard Enumeration Problems},
author = {Nadia Creignou and Markus Kröll and Reinhard Pichler and Sebastian Skritek and Heribert Vollmer},
journal= {arXiv preprint arXiv:1610.05493},
year = {2017}
}
Comments
Preprint submitted to Elsevier