Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03346578n
Noun Named Entity
Categories: Complexity classes
EN
EXPSPACE  NEXPSPACE
EN
In computational complexity theory, EXPSPACE is the set of all decision problems solvable by a deterministic Turing machine in exponential space, i.e., in O {\displaystyle O} space, where p {\displaystyle p} is a polynomial function of n {\displaystyle n}. Wikipedia
Definitions
Relations
Sources
EN
In computational complexity theory, EXPSPACE is the set of all decision problems solvable by a deterministic Turing machine in exponential space, i.e., in O {\displaystyle O} space, where p {\displaystyle p} is a polynomial function of n {\displaystyle n}. Wikipedia
Complexity class Wikidata
IS A
complexity class
HAS PART
ESPACE
NEXPTIME
PART OF
2-EXPTIME
Wikipedia
EN
EXPSPACE
Wikidata
EN
EXPSPACE
Wikipedia Redirections
EN
NEXPSPACE

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