The complexity of promise problems with applications to public-key cryptography
- 1 May 1984
- journal article
- Published by Elsevier in Information and Control
- Vol. 61 (2), 159-173
- https://doi.org/10.1016/s0019-9958(84)80056-x
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Relativized cryptographyIEEE Transactions on Information Theory, 1983
- Relativized Questions Involving Probabilistic AlgorithmsJournal of the ACM, 1982
- A note on the complexity of cryptography (Corresp.)IEEE Transactions on Information Theory, 1979
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- Partial algorithm problems for context free languagesInformation and Control, 1967