On Symmetric Differences of NP-Hard Sets with Weakly P-Selective Sets
暂无分享,去创建一个
[1] Stephen R. Mahaney. Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..
[2] Ker-I Ko. On Self-Reducibility and Weak P-Selectivity , 1983, J. Comput. Syst. Sci..
[3] Bin Fu,et al. On closeness of NP-hard sets to other complexity classes , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.
[4] Alan L. Selman. Some Observations on NP, Real Numbers and P-Selective Sets , 1981, J. Comput. Syst. Sci..
[5] Steven Fortune,et al. A Note on Sparse Complete Sets , 1978, SIAM J. Comput..
[6] Osamu Watanabe,et al. On polynomial time bounded truth-table reducibility of NP sets to sparse sets , 1990, STOC '90.
[7] C. Jockusch. Semirecursive sets and positive reducibility , 1968 .
[8] Ker-I Ko,et al. On Sets Truth-Table Reducible to Sparse Sets , 1988, SIAM J. Comput..
[9] Alan L. Selman,et al. Reductions on NP and P-Selective Sets , 1982, Theor. Comput. Sci..
[10] S. Homer,et al. On reductions of NP sets to sparse sets , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[11] Yaacov Yesha,et al. On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets , 1983, SIAM J. Comput..
[12] Bin Fu,et al. Exponential time and subexponential time sets , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.