Here you can download and read the last version of our article reporting our proof that . It was submitted to a specialized journal on Theory of Computation and Computational Complexity. While the referees do not finish their reviewing we decide to provide public access to the text and additional material that do not fit in the format of a journal paper.

The article is here NP vs PSPACE. Besides the proof of the main result, it contains two examples of huge (exponentially big) proofs that are converted to polynomially bounded proofs by means of our compressing method that convert tree-like proofs in dag-like ones. A third example, exponential normal proofs of the Pigeonhole Principle are compressed in polynomially sized dag-like proofs are shown here pdf, written in A3 paper format.

If you want a quicker understanding of the approach used in the proof, please read it here.

You are welcome to criticize the text. Send messages to hermann@inf.puc-rio.br and/or leo.gordeev@gmail.com

Some observations: