.png){kind=icon}
返回
Counting Problems in Parameterized Complexity
.png){kind=icon}
OA
AI
DOI：10.1109/TST.2014.6867521.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Parameterized complexity is a multivariate theory for the analysis of computational problems. It leads to practically efficient algorithms for many NP-hard problems and also provides a much finer complexity classification for other intractable problems. Although the theory is mostly on decision problems, parameterized complexity naturally extends to counting problems as well. The purpose of this article is to survey a few aspects of parameterized counting complexity, with a particular emphasis on some general frameworks in which parameterized complexity proves to be indispensable.
Keyword:
parameterized complexity
counting problems
dichotomy theorems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
