Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03223130n
Noun Named Entity
Categories: Complexity classes
EN
NL-complete
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
Definitions
Relations
Sources
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
complexity class Wikidata
IS A
complexity class
PART OF
NL
Wikipedia
EN
NL-complete
Wikidata
EN
NL-complete
Wikipedia Redirections
EN
NL-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