Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00279005n
Noun Named Entity
NL
L
EN
In computational complexity theory, L is the complexity class containing decision problems that can be solved by a deterministic Turing machine using a logarithmic amount of writable memory space. Wikipedia
English:
complexity theory
class
complexity class
complexity
Relations
Sources
IS A
complexiteitsgraad
rekenkundig probleem
HAS PART
DLOGTIME
PART OF
SL
RL
SAID TO BE THE SAME AS
SL
Wikidata
NL
L

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