The complexity of promise problems with applications to public-key cryptography*
Under an Elsevier user license
open archive
Cited by (0)
- *
This research was done while the second author visited the Computer Science Department, Technion, Haifa, Israel, with funds provided by the United States-Israel Educational Foundation (Fulbright Award), and while the third author visited the Electrical Engineering and Computer Science Department, University of California at San Diego, La Jolla, California. Some of the results of this paper were presented by the second and third authors at the 8 th International Colloquium on Automata, Languages, and Programming, Aarhus, Denmark, July 1982. This research was supported in part by the National Science Foundation under Grants MCS77-23493 A02 and MCS81-20263.
Copyright © 1984 Published by Elsevier Inc.