On the Isomorphism Conjecture for Weak R
✍
Manindra Agrawal
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 652 KB
According to the isomorphism conjecture all NP-complete sets are polynomial-time isomorphic to each other while according to the encrypted complete set conjecture there is a p-one way function f and an NP-complete set A such that A and f (A) are not polynomial-time isomorphic to each other. In this