Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/DSPACE> ?p ?o }
Showing triples 1 to 75 of
75
with 100 triples per page.
- DSPACE abstract "In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing machine. It represents the total amount of memory space that a \"normal\" physical computer would need to solve a given computational problem with a given algorithm. It is one of the most well-studied complexity measures, because it corresponds so closely to an important real-world resource: the amount of physical computer memory needed to run a given program.".
- DSPACE wikiPageID "658520".
- DSPACE wikiPageLength "7035".
- DSPACE wikiPageOutDegree "42".
- DSPACE wikiPageRevisionID "704590152".
- DSPACE wikiPageWikiLink Algorithm.
- DSPACE wikiPageWikiLink Alternating_Turing_machine.
- DSPACE wikiPageWikiLink Big_O_notation.
- DSPACE wikiPageWikiLink Cambridge_University_Press.
- DSPACE wikiPageWikiLink Category:Complexity_classes.
- DSPACE wikiPageWikiLink Category:Computational_resources.
- DSPACE wikiPageWikiLink Complexity_class.
- DSPACE wikiPageWikiLink Computational_complexity_theory.
- DSPACE wikiPageWikiLink Computational_problem.
- DSPACE wikiPageWikiLink Computational_resource.
- DSPACE wikiPageWikiLink Computer_data_storage.
- DSPACE wikiPageWikiLink Constructible_function.
- DSPACE wikiPageWikiLink Crossing_sequence_(Turing_machines).
- DSPACE wikiPageWikiLink DSPACE.
- DSPACE wikiPageWikiLink Decision_problem.
- DSPACE wikiPageWikiLink EXPSPACE.
- DSPACE wikiPageWikiLink L_(complexity).
- DSPACE wikiPageWikiLink NSPACE.
- DSPACE wikiPageWikiLink NTIME.
- DSPACE wikiPageWikiLink Non-deterministic_Turing_machine.
- DSPACE wikiPageWikiLink PSPACE.
- DSPACE wikiPageWikiLink Pigeonhole_principle.
- DSPACE wikiPageWikiLink Regular_language.
- DSPACE wikiPageWikiLink Savitchs_theorem.
- DSPACE wikiPageWikiLink Space_hierarchy_theorem.
- DSPACE wikiPageWikiLink Springer_Science+Business_Media.
- DSPACE wikiPageWikiLink Sublinear_function.
- DSPACE wikiPageWikiLink Time_complexity.
- DSPACE wikiPageWikiLink Turing_machine.
- DSPACE wikiPageWikiLinkText "DSPACE".
- DSPACE wikiPageWikiLinkText "DSPACE#Machine models".
- DSPACE wikiPageWikiLinkText "DSPACE(f(''n''))".
- DSPACE wikiPageWikiLinkText "memory space".
- DSPACE wikiPageWikiLinkText "space complexity".
- DSPACE wikiPageWikiLinkText "space efficiency".
- DSPACE wikiPageWikiLinkText "space".
- DSPACE wikiPageUsesTemplate Template:Cite_book.
- DSPACE wikiPageUsesTemplate Template:ComplexityClasses.
- DSPACE wikiPageUsesTemplate Template:ComplexityZoo.
- DSPACE wikiPageUsesTemplate Template:For.
- DSPACE wikiPageUsesTemplate Template:Math.
- DSPACE wikiPageUsesTemplate Template:Mathcal.
- DSPACE wikiPageUsesTemplate Template:Mvar.
- DSPACE wikiPageUsesTemplate Template:Refimprove.
- DSPACE wikiPageUsesTemplate Template:Reflist.
- DSPACE wikiPageUsesTemplate Template:See.
- DSPACE subject Category:Complexity_classes.
- DSPACE subject Category:Computational_resources.
- DSPACE hypernym Resource.
- DSPACE type Model.
- DSPACE type Work.
- DSPACE type Class.
- DSPACE type Machine.
- DSPACE type Method.
- DSPACE type Model.
- DSPACE type Redirect.
- DSPACE type Resource.
- DSPACE comment "In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing machine. It represents the total amount of memory space that a \"normal\" physical computer would need to solve a given computational problem with a given algorithm.".
- DSPACE label "DSPACE".
- DSPACE sameAs Q1155722.
- DSPACE sameAs DSPACE.
- DSPACE sameAs DSPACE.
- DSPACE sameAs DSPACE.
- DSPACE sameAs DSPACE.
- DSPACE sameAs m.030ddr.
- DSPACE sameAs m.07h4k.
- DSPACE sameAs DSPACE.
- DSPACE sameAs Q1155722.
- DSPACE wasDerivedFrom DSPACE?oldid=704590152.
- DSPACE isPrimaryTopicOf DSPACE.