The proof of the P vs NP problem based on the Hadwiger conjecture (At present, as a feasible proof idea)
Year: 2026
Type: preprint
Abstract: At present, as a feasible proof idea.The proof of the P vs NP problem based on the Hadwiger conjecture proves that P ≠ NP, and the result not only solves the P vs NP problem, but also provides a structural perspective: the general difficulty of the NP complete problem essentially comes from the implicit nested occlusion of the constraint structure; and the standard The locality of the computational model determines that it cannot penetrate such deep nested structures in polynomial time. Future work can further extend this framework to other NP complete problems and establish a unified structural lower boundary theory.
Author: Zhao, Jiusi
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7225558670