A Complexity Theory for Hard Enumeration Problems
Discrete Applied Mathematics(2019)
摘要
Complexity theory provides a wealth of complexity classes for analysing 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.
更多查看译文
关键词
Computational complexity,Enumeration,Complexity classes,Reductions
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要