Abstract
We study the structure of the polynomial-time complete sets for NP and PSPACE under strong nondeterministic polynomial-time reductions (SNP-reductions). We show the following results. - If NP contains a p-random language, then all polynomial-time complete sets for PSPACE are SNP-isomorphic. - If NP PI co-NP contains a p-random language, then all polynomial-time complete sets for NP are SNP-isomorphic. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Harkins, R. C., Hitchcock, J. M., & Pavan, A. (2007). Strong reductions and isomorphism of complete sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4855 LNCS, pp. 168–178). Springer Verlag. https://doi.org/10.1007/978-3-540-77050-3_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
