Cover Image

Proofs of NP = coNP = PSPACE: Current upgrade

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gordeev, Lev, Haeusler, Edward Hermann
Format:	Preprint
Published:	2023
Subjects:	Computational Complexity 03
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On $NP \cap coNP$ proof complexity generators
by: Krajicek, Jan
Published: (2025)

On P Versus NP
by: Gordeev, Lev
Published: (2020)

A note on Jerabek's paper "A simplified lower bound for implicational logic"
by: Gordeev, Lev, et al.
Published: (2026)

A Critique of Lin's "On $\text{NP}$ versus $\text{coNP}$ and Frege Systems"
by: DeJesse, Nicholas, et al.
Published: (2025)

Real Stability and Log Concavity are coNP-Hard
by: Chin, Tracy
Published: (2024)

Thin Tree Verification is coNP-Complete
by: Moayyedi, Alice
Published: (2025)

A proof of P!=NP
by: McCallum, Rupert
Published: (2020)

The Separation of $NP$ and $PSPACE$
by: Lin, Tianrong
Published: (2021)

Exploring P versus NP
by: Tang, Jian-Gang
Published: (2022)

Some conditions implying if P=NP then P=PSPACE
by: Rodriguez, Ismael
Published: (2026)

An Oracle with no $\mathrm{UP}$-Complete Sets, but $\mathrm{NP}=\mathrm{PSPACE}$
by: Dingel, David, et al.
Published: (2024)

Evolomino is NP-complete
by: Nikolaev, Andrei V.
Published: (2025)

Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
by: Chavrimootoo, Michael C., et al.
Published: (2026)

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
by: Grüne, Christoph, et al.
Published: (2026)

On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
by: Guruswami, Venkatesan, et al.
Published: (2023)

NP-hard problems are not in BQP
by: Czerwinski, Reiner
Published: (2023)

P=NP
by: Deng, Zikang
Published: (2024)

Separation of PSPACE and EXP
by: Czerwinski, Reiner
Published: (2021)

NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
by: Ruangwises, Suthee
Published: (2024)

Stiefel optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2025)

Nondango is NP-Complete
by: Ruangwises, Suthee
Published: (2023)

Wataridori is NP-Complete
by: Ruangwises, Suthee
Published: (2026)

P vs. NP
by: Uribe, Daniel
Published: (2016)

NP-Completeness Proofs of Puzzles using the T-Metacell Framework
by: Kiatchaipipat, Nattapol, et al.
Published: (2025)

NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam
by: Otsuji, Taisei, et al.
Published: (2026)

BusOut is NP-complete
by: Ishibashi, Takehiro, et al.
Published: (2025)

Communication Complexity is NP-hard
by: Hirahara, Shuichi, et al.
Published: (2025)

On Kernelization with Access to NP-Oracles
by: Molter, Hendrik, et al.
Published: (2025)

Semi-Algebraic Proof Systems for QBF
by: Beyersdorff, Olaf, et al.
Published: (2025)

The 2-Attractor Problem is NP-Complete
by: Fuchs, Janosch, et al.
Published: (2023)

A Critique of Deng's "P=NP"
by: Humphreys, Isabel, et al.
Published: (2025)

NP-Completeness of Neighborhood Balanced Colorings
by: Asaeedi, Saeed
Published: (2024)

NP-Completeness of Multicast Beamforming in Wireless Communication
by: Shrestha, Sagar
Published: (2025)

The 7 faces of quantum NP
by: Gharibian, Sevag
Published: (2023)

A Simple Proof that Ricochet Robots is PSPACE-Complete
by: Balanza-Martinez, Jose, et al.
Published: (2024)

Limits of structures and Total NP Search Problems
by: Ježil, Ondřej
Published: (2023)

L is different from NP
by: Montoya, J. Andres
Published: (2024)

NP-hardness of SVP in Euclidean Space
by: Wan, Daqing
Published: (2026)

Optimizing for aggressive-style strategies in Flesh and Blood is NP-hard
by: Romão, Leonardo Gasparini, et al.
Published: (2025)

On the NP-Hardness Approximation Curve for Max-2Lin(2)
by: Martinsson, Björn
Published: (2024)