Matches in DBpedia 2015-10 for { ?s ?p "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."@en }
Showing triples 1 to 2 of
2
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 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.".