PSPACE

E1751079 UNEXPLORED

PSPACE is the complexity class of decision problems that can be solved by a Turing machine using a polynomial amount of memory, regardless of how much time they take.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
PSPACE canonical	7

Referenced by (7)

Full triples — surface form annotated when it differs from this entity's canonical label.

EXPTIME → supersetOf → PSPACE ⓘ

subject linked to: complexity class EXPTIME

EXPTIME → believedToBeProperSupersetOf → PSPACE ⓘ

subject linked to: complexity class EXPTIME

BPP → subsetOf → PSPACE ⓘ

subject linked to: complexity class BPP

RP → subsetOf → PSPACE ⓘ

subject linked to: complexity class RP

NL → subsetOf → PSPACE ⓘ

subject linked to: complexity class NL

NL → relatedTo → PSPACE ⓘ

subject linked to: complexity class NL

Papadimitriou: Computational Complexity → topic → PSPACE ⓘ