Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03116255n
Noun Named Entity
SYL
No term available
EN
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. Wikipedia
English:
complexity
Relations
Sources
IS A
EN
complexity class
HAS PART
EN
PSPACE-complete
EN
PH
EN
PP
PART OF
EN
E
HAS KIND
EN
PSPACE-complete
SAID TO BE THE SAME AS
EN
QIP
EN
IP

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License