A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
One-way functions and the isomorphism conjecture
1994
Theoretical Computer Science
Abslract Ganesan, K., One-way functions and the isomorphism conjecture, Theoretical Computer Science 129 (1994) 3099321. The isomorphism conjecture is investigated for exponential-time and other complexity classes. If one-way functions exist, then we show that there are one-way functions such that A gpf(,4), where A is a standard complete set for NP or E or NE. If one-way functions exist, we also show that there are k-completely creative sets in NP with one-way productive functions but which
doi:10.1016/0304-3975(94)90031-0
fatcat:fsck4buhybhdxnukblpse4geue