A Complexity Theory for Hard Enumeration Problems release_zpwbkjju3ff5hnjp4qyvsxif5a

by Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer

Released as a article .

2016  

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.
In text/plain format

Archived Files and Locations

application/pdf  484.4 kB
file_m5o2wi34bfa6no2qkeu4jdkzoa
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-10-18
Version   v1
Language   en ?
arXiv  1610.05493v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 552431e5-1c88-41d8-9914-f92fc0ed5165
API URL: JSON