Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03223130n
Noun Named Entity
JA
No term available
EN
In computational complexity theory, NL-complete is a complexity class containing the languages that are complete for NL, the class of decision problems that can be solved by a nondeterministic Turing machine using a logarithmic amount of memory space. Wikipedia
Relations
Sources
IS A
複雑性クラス
PART OF
NL

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