具有泛因子图的非交换群上的Max-3-Lin
Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs
摘要:
具有n个变量和m个约束的约束满足问题的实例的因子图是[m]和[n]之间的二分图,描述哪个变量出现在哪个约束中。因此,CSP的实例完全由其因子图和谓词列表定义。我们展示了非阿贝尔群上的Max-3-LIN的不可逼近性(无论是在完美完备性的情况下还是在不完美完备性的情况下),具有与一般情况下相同的不可逼近因子,即使因子图是固定的。在此过程中,我们还表明,即使我们将Max-3-LIN实例中的线性方程限制为x * y * z = g的形式,这些最佳硬度结果也保持不变,其中x,y,z是变量,g是群元素。我们使用表示理论和傅立叶分析非阿贝尔群分析的减少。
英文摘要:
Factor graph of an instance of a constraint satisfaction problem with n variables and m constraints is the bipartite graph between [m] and [n] describing which variable appears in which constraints. Thus, an instance of a CSP is completely defined by its factor graph and the list of predicates. We show inapproximability of Max-3-LIN over non-abelian groups (both in the perfect completeness case and in the imperfect completeness case), with the same inapproximability factor as in the general case, even when the factor graph is fixed. Along the way, we also show that these optimal hardness results hold even when we restrict the linear equations in the Max-3-LIN instances to the form x * y * z = g, where x, y, z are the variables and g is a group element. We use representation theory and Fourier analysis over non-abelian groups to analyze the reductions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。