Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00274091n
Noun Named Entity
SYL
No term available
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
Relations
Sources
IS A
EN
complexity class
HAS PART
EN
SL
EN
RL
EN
NL-complete
PART OF
LOGCFL
EN
CC
EN
PL

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