Strong Reductions and Isomorphism of Complete Sets

Ryan C. Harkins,John M. Hitchcock,A. Pavan

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science: 27th International Conference, New Delhi, India, December 12-14, 2007. Proceedings（2023）

引用 1|浏览0

暂无评分

摘要

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.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要