Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)
The complexity of promise problems
A “promise problem” is a formulation of a partial decision problem. Complexity issues about promise problems arise from Even and Yacobi's work in public-key cryptography
KeywordsPolynomial Time Turing Machine Computer Science Department Satisfying Assignment Context Free Language
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Even, S. and Yacobi, Y., Cryptocomplexity and NP-completeness, Proc. of ICALP-80, Springer-Verlag Lecture Notes in Computer Science, Vol. 80, 195–207.Google Scholar
- 2.Ladner, R.E., On the structure of polynomial time reducibility, J. ACM 22 (1975).Google Scholar
- 3.Sipser, M., On relativization and the existence of complete sets, this conference.Google Scholar
© Springer-Verlag Berlin Heidelberg 1982