Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03346326n
Noun Named Entity
Categories: All articles with unsourced statements, Complexity classes
EN
PSPACE-complete  PSPACE complete
EN
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
Definitions
Relations
Sources
EN
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
Complexity class Wikidata
IS A
complexity class
PART OF
PSPACE
Wikipedia
EN
PSPACE-complete
Wikidata
EN
PSPACE-complete
Wikipedia Redirections
EN
PSPACE-Complete, Pspace-complete, Pspace-Complete, PSPACE complete

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