In computational complexity theory, a promise problem is a generalization of a decision problem where the input is promised to belong to a subset of all possible inputs. Unlike decision problems, the yes instances (the inputs for which an algorithm must return yes) and no instances do not exhaust the set of all inputs. Intuitively, the algorithm has been promised that the input does indeed belong to set of yes instances or no instances. There may be inputs which are neither yes or no. If such an input is given to an algorithm for solving a promise problem, the algorithm is allowed to output anything.
Read more about Promise Problem: Formal Definition, Examples
Famous quotes containing the words promise and/or problem:
“At fifteen, beauty and talent do not exist; there can only be promise of the coming woman.”
—Honoré De Balzac (1799–1850)
“Congress seems drugged and inert most of the time. ...Its idea of meeting a problem is to hold hearings or, in extreme cases, to appoint a commission.”
—Shirley Chisholm (b. 1924)