The Complexity of X3SAT: P = NP = PSPACE
Latif Salum
TL;DR
This paper claims to prove that P, NP, and PSPACE are all equal, which would resolve major open problems in computational complexity, and also addresses the Graph Isomorphism problem.
Contribution
It presents a proof that P equals NP and PSPACE, and discusses implications for Graph Isomorphism.
Findings
P = NP = PSPACE proven in this work
Implications for complexity class hierarchies
Discussion on Graph Isomorphism complexity
Abstract
This paper shows that P = NP = PSPACE. It also tackles Graph Isomorphism.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Optimization and Search Problems · Constraint Satisfaction and Optimization