DeepAI AI Chat
Log In Sign Up

Proof compression and NP versus PSPACE: Addendum

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. Part 2

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]:...
12/04/2020

On proof theory in computer science

The subject logic in computer science should entail proof theoretic appl...
11/17/2020

Proof Compression and NP Versus PSPACE II: Addendum

In [3] we proved the conjecture NP = PSPACE by advanced proof theoretic ...
09/07/2020

A Simpler NP-Hardness Proof for Familial Graph Compression

This document presents a simpler proof showcasing the NP-hardness of Fam...
11/16/2017

On Communication Complexity of Classification Problems

This work introduces a model of distributed learning in the spirit of Ya...
11/20/2017

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

We review André Luiz Barbosa's paper "P != NP Proof," in which the class...
08/24/2022

On the existence of strong proof complexity generators

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