CCMay 12
Proofs of NP = coNP = PSPACE: Current upgrade
arXiv:2311.1793910.31 citationsh-index: 13
Predicted impact top 56% in CC · last 90 daysOriginality Synthesis-oriented
AI Analysis
For complexity theorists, this claims to resolve major open problems, but the lack of verification and incremental nature of the upgrade suggests limited immediate impact.
The paper presents an upgraded version of proofs claiming NP = coNP = PSPACE, addressing critiques from Jerabek's paper. No concrete results or numbers are provided.
In this paper we present a more transparent upgrade of our proofs and comment on Jerabek's paper [8].