arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.09504cs.CCcs.DMmath.LO
收藏

具有多项式生成幂性质的量化CSP的复杂性

The complexity of the Quantified CSP having the polynomially generated powers property

Dmitriy Zhuk

摘要:

已知如果约束语言的多态代数具有多项式生成幂(PGP)性质,则量化CSP可以约简为具有常数的相同约束语言上的CSP。这种简化的唯一限制是它只适用于具有常量的约束语言。我们大大简化了约简,并将其推广到没有常量的约束语言。因此,我们完全分类的复杂性QCSP的约束语言的PGP属性。

英文摘要:

It is known that if an algebra of polymorphisms of the constraint language has the Polynomially Generated Powers (PGP) Property then the Quantified CSP can be reduced to the CSP over the same constraint language with constants. The only limitation of this reduction is that it is applicable only for the constraint languages with constants. We drastically simplified the reduction and generalized it for constraint languages without constants. As a result, we completely classified the complexity of the QCSP for constraint languages having the PGP property.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑