Every polynomial-time 1-degree collapses if and only if P = PSPACE
From MaRDI portal
Publication:5311749
DOI10.2178/jsl/1096901763zbMath1081.03042OpenAlexW2085424088MaRDI QIDQ5311749
Stuart A. Kurtz, James S. Royer, Stephen A. Fenner
Publication date: 29 August 2005
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1096901763
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (1)
Cites Work
This page was built for publication: Every polynomial-time 1-degree collapses if and only if P = PSPACE