Promise Problems
In computational complexity theory, it is usually implicitly assumed that any string in {0, 1}* represents an instance of the computational problem in question. However, sometimes not all strings {0, 1}* represent valid instances, and one specifies a proper subset of {0, 1}* as the set of "valid instances". Computational problems of this type are called promise problems.
The following is an example of a (decision) promise problem:
- "Given a graph G, determine if every independent set in G has size at most 5, or G has an independent set of size at least 10."
Here, the valid instances are those graphs whose maximum independent set size is either at most 5 or at least 10.
Decision promise problems are usually represented as pairs of disjoint subsets (Lyes, Lno) of {0, 1}*. The valid instances are those in Lyes ∪ Lno. Lyes and Lno represent the instances whose answer is yes and no, respectively.
Promise problems play an important role in several areas of computational complexity, including hardness of approximation, property testing, and interactive proof systems.
Read more about this topic: Computational Problem
Famous quotes containing the words promise and/or problems:
“Why didst thou promise such a beauteous day,
And make me travel forth without my cloak,
To let base clouds o’ertake me in my way,”
—William Shakespeare (1564–1616)
“The problems of society will also be the problems of the predominant language of that society. It is the carrier of its perceptions, its attitudes, and its goals, for through it, the speakers absorb entrenched attitudes. The guilt of English then must be recognized and appreciated before its continued use can be advocated.”
—Njabulo Ndebele (b. 1948)