A Critique of Uribe's "P vs. NP"

Abstract

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.