Sciweavers

FSTTCS
2007
Springer

Strong Reductions and Isomorphism of Complete Sets

13 years 9 months ago
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.
Ryan C. Harkins, John M. Hitchcock, Aduri Pavan
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where FSTTCS
Authors Ryan C. Harkins, John M. Hitchcock, Aduri Pavan
Comments (0)