The complexity of promise problems

  • Alan L. Selman
  • Yacov Yacobi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)


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


Polynomial 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.

Unable to display preview. Download preview PDF.


  1. 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. 2.
    Ladner, R.E., On the structure of polynomial time reducibility, J. ACM 22 (1975).Google Scholar
  3. 3.
    Sipser, M., On relativization and the existence of complete sets, this conference.Google Scholar
  4. 4.
    Ullian, J.S., Partial algorithm problems for context free languages, Information and Control, Vol. 11, 1967, 80–101.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Alan L. Selman
    • 1
  • Yacov Yacobi
    • 2
  1. 1.Computer Science DepartmentIowa State UniversityAmesUSA
  2. 2.Electrical Engineering DepartmentTechnionHaifaIsrael

Personalised recommendations