Opening book details…
Can I read Strong Polynomial-time Reducibility on EtoBox?
Strong Polynomial-time Reducibility by Juichi Shinoda is a Computer Science article available to read on EtoBox.
What is Strong Polynomial-time Reducibility about?
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 III2 theory of the low degrees.
Who reads Strong Polynomial-time Reducibility?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Juichi Shinoda
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0168-0072)
- Published
- 1997
- Language
- EN
- Field
- Computer Science (Physical Sciences)