P=NP
pith:FKQB2XVPopen to challenge →
classification
cs.CC
cs.AI
keywords
argumentclaimformalproblemresolve
read the original abstract
We claim to resolve the P=?NP problem via a formal argument for P=NP.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.