Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q130203> ?p ?o }
Showing triples 1 to 21 of
21
with 100 triples per page.
- Q130203 subject Q7132792.
- Q130203 abstract "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, and may even not halt.".
- Q130203 wikiPageExternalLink 018.
- Q130203 wikiPageWikiLink Q1137554.
- Q130203 wikiPageWikiLink Q1195339.
- Q130203 wikiPageWikiLink Q1415372.
- Q130203 wikiPageWikiLink Q205084.
- Q130203 wikiPageWikiLink Q215382.
- Q130203 wikiPageWikiLink Q2362762.
- Q130203 wikiPageWikiLink Q245595.
- Q130203 wikiPageWikiLink Q273037.
- Q130203 wikiPageWikiLink Q3262192.
- Q130203 wikiPageWikiLink Q3435924.
- Q130203 wikiPageWikiLink Q5177154.
- Q130203 wikiPageWikiLink Q6030974.
- Q130203 wikiPageWikiLink Q7132792.
- Q130203 wikiPageWikiLink Q906766.
- Q130203 wikiPageWikiLink Q924044.
- Q130203 wikiPageWikiLink Q984063.
- Q130203 comment "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.".
- Q130203 label "Promise problem".