P is not equal to NP

Abstract

In this paper, we prove that P is not equal to NP. The proof is based on the Boolean Satisfiability problem(SAT). For any algorithm to solve SAT instances, we prove that there is an exponential lower bound in computation complexity, so that we have P is not equal to NP.

arXiv commentA flaw is found by others