DeepAI AI Chat
Log In Sign Up

Proof compression and NP versus PSPACE. Part 2

07/08/2019
by   Lev Gordeev, et al.
0

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)

READ FULL TEXT

page 1

page 2

page 3

page 4

07/08/2019

Proof compression and NP versus PSPACE: Addendum

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]:...
11/20/2017

Critique of Barbosa's "P != NP Proof"

We review André Luiz Barbosa's paper "P != NP Proof," in which the class...
11/17/2020

Proof Compression and NP Versus PSPACE II: Addendum

In [3] we proved the conjecture NP = PSPACE by advanced proof theoretic ...
08/24/2022

On the existence of strong proof complexity generators

The working conjecture from K'04 that there is a proof complexity genera...
11/04/2020

Postulate-based proof of the P != NP hypothesis

The paper contains a proof for the P != NP hypothesis with the help of t...
08/20/2020

Optimal Network Compression

This paper introduces a formulation of the optimal network compression p...
08/19/2021

Separation of P and NP

There have been many attempts to solve the P versus NP problem. However,...