论文信息 - Strong Polynomial-Time Reducibility

Strong Polynomial-Time Reducibility

Abstract The degree structure of functions induced by a polynomial-time reducibility first introduced in G. Miller's work on the complexity of prime factorization is investigated. Several basic results are established including the facts that the degrees restricted to the sets do not form an upper semilattice and there is a minimal degree, as well as density for the low degrees, a weak form of the exact pair theorem, the existence of minimal pairs and the decidability of the Π2 theory of the low degrees.

Juichi Shinoda

[1] Klaus Ambos-Spies,et al. The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable , 1992, STACS.

[2] Rodney G. Downey,et al. On Computational Complexity and Honest Polynomial Degrees , 1991, Theor. Comput. Sci..

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

[4] Juichi Shinoda,et al. On Pi_2 Theories of hp-T Degrees of Low Sets , 1994, Theor. Comput. Sci..

[5] Pavel Pudlák,et al. Every finite lattice can be embedded in a finite partition lattice , 1980 .

[6] Steven Homer,et al. Minimal degrees for polynomial reducibilities , 1987, JACM.

[7] Gary L. Miller. Riemann's Hypothesis and Tests for Primality , 1976, J. Comput. Syst. Sci..

[8] Richard A. Shore,et al. The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory , 1992, Theor. Comput. Sci..

[9] Klaus Ambos-Spies,et al. Honest Polynomial Time Reducibilities and the P = ? NP Problem , 1989, J. Comput. Syst. Sci..

[10] Rodney G. Downey. Nondiamond Theorems for Polynomial Time Reducibility , 1992, J. Comput. Syst. Sci..

[11] Theodore A. Slaman,et al. On the Theory of the PTIME Degrees of the Recursive Sets , 1990, J. Comput. Syst. Sci..