Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q906766> ?p ?o }
Showing triples 1 to 30 of
30
with 100 triples per page.
- Q906766 subject Q7132792.
- Q906766 abstract "In computational complexity theory, a function problem is a computational problem where a single output (of a total function) is expected for every input, but the output is more complex than that of a decision problem, that is, it isn't just YES or NO.".
- Q906766 wikiPageWikiLink Q1143357.
- Q906766 wikiPageWikiLink Q1190223.
- Q906766 wikiPageWikiLink Q1197709.
- Q906766 wikiPageWikiLink Q163310.
- Q906766 wikiPageWikiLink Q173740.
- Q906766 wikiPageWikiLink Q1756942.
- Q906766 wikiPageWikiLink Q184754.
- Q906766 wikiPageWikiLink Q205084.
- Q906766 wikiPageWikiLink Q215206.
- Q906766 wikiPageWikiLink Q23389.
- Q906766 wikiPageWikiLink Q2362762.
- Q906766 wikiPageWikiLink Q2393193.
- Q906766 wikiPageWikiLink Q2898181.
- Q906766 wikiPageWikiLink Q2898287.
- Q906766 wikiPageWikiLink Q322212.
- Q906766 wikiPageWikiLink Q3262192.
- Q906766 wikiPageWikiLink Q3435924.
- Q906766 wikiPageWikiLink Q4846249.
- Q906766 wikiPageWikiLink Q5177154.
- Q906766 wikiPageWikiLink Q628036.
- Q906766 wikiPageWikiLink Q7132792.
- Q906766 wikiPageWikiLink Q837518.
- Q906766 wikiPageWikiLink Q846354.
- Q906766 wikiPageWikiLink Q875276.
- Q906766 wikiPageWikiLink Q970152.
- Q906766 wikiPageWikiLink Q984063.
- Q906766 comment "In computational complexity theory, a function problem is a computational problem where a single output (of a total function) is expected for every input, but the output is more complex than that of a decision problem, that is, it isn't just YES or NO.".
- Q906766 label "Function problem".