Techrxiv20230710.pdf (135.94 kB)

The Proof of P=NP

Download (135.94 kB)
posted on 2023-07-14, 04:24 authored by Yijie HanYijie Han

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 as paper arXiv:1612.04208. 


Email Address of Submitting Author

Submitting Author's Institution

University of Missouri at Kansas City

Submitting Author's Country

  • United States of America

Usage metrics