Upgrade of proofs asserting NP = coNP = PSPACE with comments on Jerabek's critique.
Jeˇ r´ abek,A simplified lower bound for implicational logic , Cambridge University Press, Bulletin of Symbolic Logic 31 (1): 53–87 (2005)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Proofs of NP = coNP = PSPACE: Current upgrade
Upgrade of proofs asserting NP = coNP = PSPACE with comments on Jerabek's critique.