Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00274091n
Noun Named Entity
Categories: Complexity classes
EN
NL  Conl-complete  Nlog  NLOGSPACE  NLSPACE
EN
In computational complexity theory, NL is the complexity class containing decision problems that can be solved by a nondeterministic Turing machine using a logarithmic amount of memory space. Wikipedia
English:
complexity
complexity theory
complexity class
Definitions
Relations
Sources
EN
In computational complexity theory, NL is the complexity class containing decision problems that can be solved by a nondeterministic Turing machine using a logarithmic amount of memory space. Wikipedia
A computational complexity class Wikipedia Disambiguation
A computational complexity Wikidata
IS A
complexity class
HAS PART
SL
RL
NL-complete
PART OF
LOGCFL
CC
PL
Wikipedia
EN
NL (complexity)
Wikidata
EN
NL
Wikipedia Redirections
EN
Conl-complete, NL (complexity class), Nlog, NLOGSPACE, NLSPACE, Nondeterministic logarithmic space, Nondeterministic logspace, ZPL (complexity)
Wikidata Alias
EN
NL, NLOGSPACE, Nondeterministic Logarithmic-space

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