Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1063293> ?p ?o }
Showing triples 1 to 11 of
11
with 100 triples per page.
- Q1063293 subject Q7298553.
- Q1063293 abstract "In computational complexity theory, R is the class of decision problems solvable by a Turing machine, which is the set of all recursive languages.".
- Q1063293 wikiPageWikiLink Q1148456.
- Q1063293 wikiPageWikiLink Q1455907.
- Q1063293 wikiPageWikiLink Q163310.
- Q1063293 wikiPageWikiLink Q176452.
- Q1063293 wikiPageWikiLink Q205084.
- Q1063293 wikiPageWikiLink Q3262192.
- Q1063293 wikiPageWikiLink Q7298553.
- Q1063293 comment "In computational complexity theory, R is the class of decision problems solvable by a Turing machine, which is the set of all recursive languages.".
- Q1063293 label "R (complexity)".