期刊
RANDOM STRUCTURES & ALGORITHMS
卷 38, 期 3, 页码 251-268出版社
WILEY-BLACKWELL
DOI: 10.1002/rsa.20323
关键词
random formulas; satisfiability; k-SAT; statistical mechanics; computational complexity
资金
- NSF [CCF-0546900]
- Alfred P. Sloan Research Fellowship
- ERC IDEAS [210743]
- DFG [CO 646]
- European Research Council (ERC) [210743] Funding Source: European Research Council (ERC)
For various random constraint satisfaction problems there is a significant gap between the largest constraint density for which solutions exist and the largest density for which any polynomial time algorithm is known to find solutions. Examples of this phenomenon include random k-SAT, random graph coloring, and a number of other random constraint satisfaction problems. To understand this gap, we study the structure of the solution space of random k-SAT (i.e., the set of all satisfying assignments viewed as a subgraph of the Hamming cube). We prove that for densities well below the satisfiability threshold, the solution space decomposes into an exponential number of connected components and give quantitative bounds for the diameter, volume, and number. (c) 2010 Wiley Periodicals, Inc. Random Struct. Alg., 38, 251-268, 2011
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据