当前位置:
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
中文翻译:
用于参数化计数问题的压实机
更新日期:2021-01-04
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 and a parameterization , a compactor consists of a polynomial-time computable function , called condenser, and a computable function , called extractor, such that . If the size of is bounded by a polynomial function of , then we say that the compactor is of polynomial size. Compactors can be seen as an attempt to formalize the notion of preprocessing for counting problems.
中文翻译:
用于参数化计数问题的压实机
压实机的概念已在Kim等人中引入。(2018)作为参数化计数问题的通用数据精简概念。对于功能 和参数化 压实机 由多项式时间可计算函数组成 称为冷凝器和可计算函数,称为提取器,这样。如果大小 由以下项的多项式函数限定 ,那么我们说压实机 是多项式大小。压实机可以看作是对用于计数问题的预处理概念进行形式化的尝试。