论文标题
对乌里贝（Uribe）的“ P vs. NP”的批评
A Critique of Uribe's "P vs. NP"
论文作者
论文摘要
在这一批评中，我们研究了丹尼尔·乌里里（Daniel Uribe）的技术报告，名为“ P vs. NP”。该论文声称在决定集团的算法的运行时显示了指数下限。我们表明，本文的证据无法概括到所有可能的算法，即使在适用证据的算法上，证据的论点也存在缺陷。
In this critique, we examine the technical report by Daniel Uribe entitled "P vs. NP." The paper claims to show an exponential lower bound on the runtime of algorithms that decide CLIQUE. We show that the paper's proofs fail to generalize to all possible algorithms and that, even on those algorithms to which the proofs do apply, the proofs' arguments are flawed.
