A Complexity Theory for Hard Enumeration Problems

Abstract : Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enu-meration 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.
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02439418
Contributor : Nadia Creignou <>
Submitted on : Tuesday, January 14, 2020 - 3:53:25 PM
Last modification on : Tuesday, January 21, 2020 - 1:56:17 AM

File

CreignouKPSV18.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer. A Complexity Theory for Hard Enumeration Problems. Discrete Applied Mathematics, Elsevier, 2019, 268, pp.191-209. ⟨10.1016/j.dam.2019.02.025⟩. ⟨hal-02439418⟩

Share

Metrics

Record views

14

Files downloads

25