arXiv (All)
open access
The Separation of $\mathit{NP}$ and $\mathit{PSPACE}$
There is an important and interesting open question in computational complexity on the relation between the complexity classes $\mathcal{NP}$ and $\mathcal{PSPACE}$. It is a widespread belief that $\mathcal{NP}\ne\mathcal{PSPACE}$. In this paper, we confirm this conjecture affirmatively by showing t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Parameterized complexity from P to NP-hard and back again#787543
- The Pa3 Conjecture-Vô Conjecture 5 series 5(VC5S5)#204435
- What drives complexity?#167409
- Computational Work Extraction: The Complexity of Catalysts#1154583
- Tree-independence number of $P_5$-free graphs with no large bicliques#1035482
Record · ID 974124
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive