Showing cs.CCShow all
3 papers · 1 filter
cs.CC2026
A note on Jerabek's paper "A simplified lower bound for implicational logic"
Lev Gordeev, Edward Hermann Haeusler
In our previous papers we sketched proofs of the equality NP = coNP = PSPACE. These results have been obtained by proof theoretic tree-to-dag compressing techniques adapted to Praw…
cs.CC2023
Proofs of NP = coNP = PSPACE: Current upgrade
Lev Gordeev, Edward Hermann Haeusler
In this paper we present a more transparent upgrade of our proofs and comment on Jerabek's paper [8].
cs.CC2020
On P Versus NP
Lev Gordeev
It is shown that graph-theoretic problem CLIQUE can't be solved in polynomial time by any deterministic TM. This upgrades the well-known partial result that claims only monotone un…