arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1204.6484cs.CC
收藏

泛因子图

Universal Factor Graphs

Uriel Feige, Shlomo Jozeph

摘要:

在n个布尔变量和m个约束(CSP,如k-SAT,k-AND,k-LIN)上的对称约束满足问题的实例的因子图是描述哪些变量出现在哪些约束中的二分图。因子图描述了直到变量极性的实例,因此有多达2km的CSP实例共享相同的因子图。众所周知,具有某些结构属性的因子图使得底层CSP更容易精确求解(例如,对于树结构)或大约(例如,对于平面结构)。我们感兴趣的是以下问题:是否存在一个因子图,如果可以用这个特定的因子图解决CSP的每个实例,那么可以解决CSP的每个实例,而不管因子图(类似地,对于近似)?我们称这样的因子图为泛因子图。由于对于不同的n和m值需要不同的因子图,这就产生了泛因子图族的概念。本文对泛因子图进行了系统的研究,并给出了max-kSAT的一些结果。我们的工作与预处理的概念,如以前研究的最接近的码字和最接近的格向量的问题,PCP定理的证明,并与测试的长代码。许多问题仍然悬而未决。

英文摘要:

The factor graph of an instance of a symmetric constraint satisfaction problem on n Boolean variables and m constraints (CSPs such as k-SAT, k-AND, k-LIN) is a bipartite graph describing which variables appear in which constraints. The factor graph describes the instance up to the polarity of the variables, and hence there are up to 2km instances of the CSP that share the same factor graph. It is well known that factor graphs with certain structural properties make the underlying CSP easier to either solve exactly (e.g., for tree structures) or approximately (e.g., for planar structures). We are interested in the following question: is there a factor graph for which if one can solve every instance of the CSP with this particular factor graph, then one can solve every instance of the CSP regardless of the factor graph (and similarly, for approximation)? We call such a factor graph universal. As one needs different factor graphs for different values of n and m, this gives rise to the notion of a family of universal factor graphs. We initiate a systematic study of universal factor graphs, and present some results for max-kSAT. Our work has connections with the notion of preprocessing as previously studied for closest codeword and closest lattice-vector problems, with proofs for the PCP theorem, and with tests for the long code. Many questions remain open.

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

↑