Strong Reductions and Isomorphism of Complete Sets

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 ∩ co-NP contains a p-random language, then all polynomial-time complete sets for NP are SNP-isomorphic.

• Type: Conference
• Year: 2007
• Where: FSTTCS
• Authors: Ryan C. Harkins, John M. Hitchcock, Aduri Pavan
• Keywords: FSTTCS 2007, P-random Language, Polynomial-time Complete Sets, Strong Nondeterministic Polynomial-time