论文信息 - On One-Way Functions and Polynomial-Time Isomorphisms

On One-Way Functions and Polynomial-Time Isomorphisms

It is shown that if one-way functions exist, then there are sets A and B such that A and B are equivalent under one-one and length-increasing polynomial-time reductions, and such that A is not polynomial-time isomorphic to B. Furthermore, sets A and B can be constructed such that they are polynomial-time truth-table complete for the class of exponential-time computable sets.

Ding-Zhu Du | Timothy J. Long | Ker-I Ko

[1] Paul Young,et al. Some structural properties of polynomial reducibilities and sets in NP , 1983, STOC.

[2] L. Berman. Polynomial reducibilities and complete sets. , 1977 .

[3] Juris Hartmanis,et al. On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..

[4] Deborah Joseph,et al. Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP , 1985, Theor. Comput. Sci..

[5] Alan L. Selman,et al. Complexity Measures for Public-Key Cryptosystems (Preliminary Report) , 1984, FOCS.

[6] Osamu Watanabe. On One-One Polynomial Time Equivalence Relations , 1985, Theor. Comput. Sci..

[7] Ker-I Ko,et al. On Some Natural Complete Operators , 1985, Theor. Comput. Sci..

[8] Alan L. Selman,et al. Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..