
Proof compression and NP versus PSPACE: Addendum
We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]:...
read it

From DNF compression to sunflower theorems via regularity
The sunflower conjecture is one of the most wellknown open problems in ...
read it

Proof compression and NP versus PSPACE. Part 2
We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]:...
read it

Proof Compression and NP Versus PSPACE II: Addendum
In [3] we proved the conjecture NP = PSPACE by advanced proof theoretic ...
read it

On Communication Complexity of Classification Problems
This work introduces a model of distributed learning in the spirit of Ya...
read it

Complexity Science for Simpletons
In this article, we shall describe some of the most interesting topics i...
read it

The CookReckhow definition
The CookReckhow 1979 paper defined the area of research we now call Pro...
read it
On proof theory in computer science
The subject logic in computer science should entail proof theoretic applications. So the question arises whether open problems in computational complexity can be solved by advanced proof theoretic techniques. In particular, consider the complexity classes NP, coNP and PSPACE. It is wellknown that NP and coNP are contained in PSPACE, but till recently precise characterization of these relationships remained open. Now [2], [3] (see also [4]) presented proofs of corresponding equalities NP = coNP = PSPACE. These results were obtained by appropriate proof theoretic treetodag compressing techniques to be briefy explained below. [2] L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 5583 (2019) [3] L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE II, Bulletin of the Section of Logic (49) (3): 213230 (2020) http://dx.doi.org/10.18788/01380680.2020.16 [4] L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE II: Addendum, arXiv:2011.09262 (2020)
READ FULL TEXT
Comments
There are no comments yet.