A Critique of Czerwinski's "Separation of PSPACE and EXP"

04/28/2023
by   Ian Clingerman, et al.
0

Czerwinski's paper "Separation of PSPACE and EXP" [Cze21] claims to prove that PSPACE≠ EXP by showing there is no length-increasing polynomial-time reduction from a given EXP-complete set to a given PSPACE-complete set. However, in this critique, we show that there are fundamental flaws within the paper's approach and provide a counterexample to one of the paper's theorems, which makes the proposed proof that PSPACE≠ EXP insufficient.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2023

A new approach for a proof that P is NP

In this paper we propose a new approach for developing a proof that P=NP...
research
09/07/2022

On List Coloring with Separation of the Complete Graph and Set System Intersections

We consider the following list coloring with separation problem: Given a...
research
03/27/2013

d-Separation: From Theorems to Algorithms

An efficient algorithm is developed that identifies all independencies i...
research
01/10/2019

Mechanization of Separation in Generic Extensions

We mechanize, in the proof assistant Isabelle, a proof of the axiom-sche...
research
03/15/2021

Pseudodeterministic Algorithms and the Structure of Probabilistic Time

We connect the study of pseudodeterministic algorithms to two major open...
research
06/26/2023

An FPT Algorithm for Splitting a Necklace Among Two Thieves

It is well-known that the 2-Thief-Necklace-Splitting problem reduces to ...
research
05/06/2020

A Separation Theorem for Joint Sensor and Actuator Scheduling with Guaranteed Performance Bounds

We study the problem of jointly designing a sparse sensor and actuator s...

Please sign up or login with your details

Forgot password? Click here to reset