约束、MMSNP和扩展器关系结构
Constraints, MMSNP and expander relational structures
摘要:
我们给出了一个多时间构造的组合经典称为稀疏不可比引理,研究了鄂尔多斯,Lovasz,Nesetril,Rodl和其他人:我们表明,每个约束满足问题是多时间相当于其限制大围长的结构。这意味着由Feder和Vardi引入的复杂性类CSP和Monotone Monadic Strict NP在计算上是等价的。本文的技术新颖性是扩展关系的概念和关系结构的一种新类型的产品:锯齿形产品,扭曲产品的推广。
英文摘要:
We give a poly-time construction for a combinatorial classic known as Sparse Incomparability Lemma, studied by Erdos, Lovasz, Nesetril, Rodl and others: We show that every Constraint Satisfaction Problem is poly-time equivalent to its restriction to structures with large girth. This implies that the complexity classes CSP and Monotone Monadic Strict NP introduced by Feder and Vardi are computationally equivalent. The technical novelty of the paper is a concept of expander relations and a new type of product for relational structures: a generalization of the zig-zag product, the twisted product.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。