论文标题
对Boyu Sima的批评证明了$ {\ rm P} \ neq {\ rm np} $
Critique of Boyu Sima's Proof that ${\rm P}\neq{\rm NP}$
论文作者
论文摘要
We review and critique Boyu Sima's paper, "A solution of the P versus NP problem based on specific property of clique function," (arXiv:1911.00722) which claims to prove that ${\rm P}\neq{\rm NP}$ by way of removing the gap between the nonmonotone circuit complexity and the monotone circuit complexity of the clique function.我们首先描述Sima的论点，然后描述它在哪里以及为什么失败。最后，我们提出了一个简单的示例，清楚地证明了失败。
We review and critique Boyu Sima's paper, "A solution of the P versus NP problem based on specific property of clique function," (arXiv:1911.00722) which claims to prove that ${\rm P}\neq{\rm NP}$ by way of removing the gap between the nonmonotone circuit complexity and the monotone circuit complexity of the clique function. We first describe Sima's argument, and then we describe where and why it fails. Finally, we present a simple example that clearly demonstrates the failure.
