当前位置: X-MOL 学术Comput. Sci. Rev. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Compactors for parameterized counting problems
Computer Science Review ( IF 13.3 ) Pub Date : 2021-01-02 , DOI: 10.1016/j.cosrev.2020.100344
Dimitrios M. Thilikos

The concept of compactor has been introduced in Kim et al. (2018) as a general data-reduction concept for parametrized counting problems. For a function F:ΣN and a parameterization κ:ΣN, a compactor (C,E) consists of a polynomial-time computable function P, called condenser, and a computable function M, called extractor, such that F=MP. If the size of P(x) is bounded by a polynomial function of κ(x), then we say that the compactor (C,E) is of polynomial size. Compactors can be seen as an attempt to formalize the notion of preprocessing for counting problems.



中文翻译:

用于参数化计数问题的压实机

压实机的概念已在Kim等人中引入。(2018)作为参数化计数问题的通用数据精简概念。对于功能FΣñ 和参数化 κΣñ压实机 CË 由多项式时间可计算函数组成 P称为冷凝器和可计算函数中号,称为提取器,这样F=中号P。如果大小PX 由以下项的多项式函数限定 κX,那么我们说压实机 CË是多项式大小。压实机可以看作是对用于计数问题的预处理概念进行形式化的尝试。

更新日期:2021-01-04
down
wechat
bug