论文信息 - Strong Nondeterministic Polynomial-Time Reducibilities

Strong Nondeterministic Polynomial-Time Reducibilities

Abstract Building on the work of Adleman and Manders [1], we define a new class of reducibilities, the strong nondeterministic polynomial-time reducibilities. We show that several reducibilities in this class differ over the recursive sets and assuming NP ≠ coNP, that they each determine different classes of NP-hard sets. Comparisons in strength are also made between the strong nondeterministic polynomial-time reducibilities and the classes of deterministic and non-deterministic polynomial-time reducibilities in Ladner, Lynch and Selman [6].

Timothy J. Long

[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[2] Timothy J. Long. On gamma-Reducibility Versus Polynomial Time Many-One Reducibility , 1981, Theor. Comput. Sci..

[3] R.E. Ladner,et al. A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

[4] Alan L. Selman,et al. Reductions on NP and P-Selective Sets , 1982, Theor. Comput. Sci..

[5] Leonard M. Adleman,et al. Reducibility, randomness, and intractibility (Abstract) , 1977, STOC '77.

[6] Richard E. Ladner,et al. On the Structure of Polynomial Time Reducibility , 1975, JACM.

[7] R. Solovay,et al. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[8] Istvan Simon. On some subrecursive reducibilities , 1977 .

[9] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[10] Leslie G. Valiant,et al. Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..

[11] Alan L. Selman,et al. Polynomial Time Enumeration Reducibility , 1978, SIAM J. Comput..

[12] T. Long. On some polynomial time reducibilities. , 1978 .

[13] John Gill,et al. Polynomial reducibilities and upward diagonalizations , 1977, STOC '77.