The Proof of P=NP

We show that the 3-satisfiability problem can be solved in polynomial time, thereby proving that P=NP.

The result of this paper is derived based on my matrix multiplication paper titled "An $O(n^4\log^4 n\log \log n)$ Time Matrix Multiplication Algorithm'' which has appeared in arXiv.org as paper arXiv:1612.04208.