Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03116255n
Noun Named Entity
Categories: Complexity classes
EN
PSPACE  AP  APTIME  NPSPACE  P = PSPACE problem
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
Definitions
Relations
Sources
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
Algorithmic complexity class Wikidata
IS A
complexity class
HAS PART
PSPACE-complete
PH
PP
PART OF
E
HAS KIND
PSPACE-complete
SAID TO BE THE SAME AS
QIP
IP
Wikipedia
EN
PSPACE
Wikidata
EN
PSPACE
Wikipedia Redirections
EN
AP (complexity), APTIME, NPSPACE, P = PSPACE problem, polynomial space, PSPACE-hard, PSPACE (complexity)
Wikidata Alias
EN
Polynomial Space class

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