Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/PSPACE> ?p ?o }
Showing triples 1 to 82 of
82
with 100 triples per page.
- PSPACE abstract "In computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space.".
- PSPACE thumbnail Complexity_subsets_pspace.svg?width=300.
- PSPACE wikiPageID "39351".
- PSPACE wikiPageLength "7235".
- PSPACE wikiPageOutDegree "36".
- PSPACE wikiPageRevisionID "674760178".
- PSPACE wikiPageWikiLink Alternating_Turing_machine.
- PSPACE wikiPageWikiLink Cambridge_University_Press.
- PSPACE wikiPageWikiLink Category:Complexity_classes.
- PSPACE wikiPageWikiLink Closed_timelike_curve.
- PSPACE wikiPageWikiLink Complement_(complexity).
- PSPACE wikiPageWikiLink Computational_complexity_theory.
- PSPACE wikiPageWikiLink Context-sensitive_language.
- PSPACE wikiPageWikiLink DSPACE.
- PSPACE wikiPageWikiLink Decision_problem.
- PSPACE wikiPageWikiLink Descriptive_complexity.
- PSPACE wikiPageWikiLink Descriptive_complexity_theory.
- PSPACE wikiPageWikiLink EXPSPACE.
- PSPACE wikiPageWikiLink EXPTIME.
- PSPACE wikiPageWikiLink IP_(complexity).
- PSPACE wikiPageWikiLink Interactive_proof_system.
- PSPACE wikiPageWikiLink NL_(complexity).
- PSPACE wikiPageWikiLink NP_(complexity).
- PSPACE wikiPageWikiLink Non-deterministic_Turing_machine.
- PSPACE wikiPageWikiLink Nondeterministic_algorithm.
- PSPACE wikiPageWikiLink PH_(complexity).
- PSPACE wikiPageWikiLink PSPACE-Complete.
- PSPACE wikiPageWikiLink PSPACE-complete.
- PSPACE wikiPageWikiLink P_(complexity).
- PSPACE wikiPageWikiLink Polynomial.
- PSPACE wikiPageWikiLink Polynomial-time_many-one_reduction.
- PSPACE wikiPageWikiLink Polynomial-time_reduction.
- PSPACE wikiPageWikiLink QIP_(complexity).
- PSPACE wikiPageWikiLink Quantified_Boolean_formula_problem.
- PSPACE wikiPageWikiLink Quantum_computer.
- PSPACE wikiPageWikiLink Quantum_computing.
- PSPACE wikiPageWikiLink Savitchs_theorem.
- PSPACE wikiPageWikiLink Second-order_logic.
- PSPACE wikiPageWikiLink Space_complexity.
- PSPACE wikiPageWikiLink Space_hierarchy_theorem.
- PSPACE wikiPageWikiLink Transitive_closure.
- PSPACE wikiPageWikiLink True_quantified_Boolean_formula.
- PSPACE wikiPageWikiLink Turing_machine.
- PSPACE wikiPageWikiLink Turing_machines.
- PSPACE wikiPageWikiLink File:Complexity_subsets_pspace.svg.
- PSPACE wikiPageWikiLinkText "PSPACE".
- PSPACE wikiPageWikiLinkText "PSPACE#PSPACE-completeness".
- PSPACE wikiPageWikiLinkText "PSPACE#Relation among other classes".
- PSPACE wikiPageWikiLinkText "PSPACE-complete".
- PSPACE wikiPageWikiLinkText "polynomial space".
- PSPACE hasPhotoCollection PSPACE.
- PSPACE wikiPageUsesTemplate Template:CZoo.
- PSPACE wikiPageUsesTemplate Template:Cite_book.
- PSPACE wikiPageUsesTemplate Template:ComplexityClasses.
- PSPACE wikiPageUsesTemplate Template:Main.
- PSPACE wikiPageUsesTemplate Template:Reflist.
- PSPACE wikiPageUsesTemplate Template:Unsolved.
- PSPACE subject Category:Complexity_classes.
- PSPACE hypernym Set.
- PSPACE type Class.
- PSPACE comment "In computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space.".
- PSPACE label "PSPACE".
- PSPACE sameAs بيسبايس.
- PSPACE sameAs PSPACE.
- PSPACE sameAs PSPACE.
- PSPACE sameAs PSPACE.
- PSPACE sameAs PSPACE.
- PSPACE sameAs PSPACE.
- PSPACE sameAs PSPACE.
- PSPACE sameAs PSPACE.
- PSPACE sameAs PSPACE.
- PSPACE sameAs PSPACE.
- PSPACE sameAs m.09sw7.
- PSPACE sameAs Класс_PSPACE.
- PSPACE sameAs Клас_складності_PSPACE.
- PSPACE sameAs PSPACE.
- PSPACE sameAs Q500716.
- PSPACE sameAs Q500716.
- PSPACE sameAs PSPACE.
- PSPACE wasDerivedFrom PSPACE?oldid=674760178.
- PSPACE depiction Complexity_subsets_pspace.svg.
- PSPACE isPrimaryTopicOf PSPACE.