Strong polynomial-time reducibility Original Research Article

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.