BabelNet

bn:03346326n

Noun Named Entity

SYL

No term available

In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input length and if every other problem that can be solved in polynomial space can be transformed to it in polynomial time. Wikipedia

Relations

Sources

IS A

complexity class

PART OF

PSPACE