我粗略看了看,他证明的思路就是我们上面yy的思路。他声称We show that there are fundamental conceptual relationships between polynomial time computation and certain directed Markov properties stated in terms of conditional independence and sufficient statistics。把多项式时间计算和一个复杂的东东联系起来。 又称 Our work shows that every polynomial time algorithm must fail to produce solutions to large enough problem instances of k - S AT in the d1RSB phase。 实际上就是举了一个例子,说明多项式时间算法没办法满足上面的东东。