In the Vinony graph
Vinony's link graph records 163 inbound references to 多項式空間類問題, and connects out to Turing machine, polynomial hierarchy and International Standard Book Number.
It is catalogued under the topic Complexity classes.
Vinony links it to 21 Wikipedia language editions.
Article · 中文
PSPACE是计算复杂度理论中能被确定型图灵机利用多项式空间解决的判定问题集合，是Polynomial SPACE的简称。
Abstract from DBpedia / Wikipedia · CC BY-SA
Gallery (4)
Connections
Turing machine
Entity
polynomial hierarchy
Entity
International Standard Book Number
Entity
digital object identifier
Entity
polynomial
Entity
bibcode
Entity
union
Entity
arXiv
Entity
Cambridge University Press
Entity
complement
Entity
quantum computing
Entity
P versus NP problem
Entity
computational complexity theory
Entity
Semantic Scholar
Entity
NP-complete
Entity
NP
Entity
decision problem
Entity
Kleene star
Entity
P
Entity
polynomial ring
Entity