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:
“A puff of wind, a puff faint and tepid and laden with strange odours of blossoms, of aromatic wood, comes out the still night—the first sigh of the East on my face. That I can never forget. It was impalpable and enslaving, like a charm, like a whispered promise of mysterious delight.... The mysterious East faced me, perfumed like a flower, silent like death, dark like a grave.”
—Joseph Conrad (1857–1924)
“I am always glad to think that my education was, for the most part, informal, and had not the slightest reference to a future business career. It left me free and untrammeled to approach my business problems without the limiting influence of specific training.”
—Alice Foote MacDougall (1867–1945)