Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00279005n
Noun Named Entity
SYL
No term available
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
complexity theory
class
complexity class
Relations
Sources
IS A
EN
complexity class
EN
computational problem
HAS PART
DLOGTIME
PART OF
EN
SL
EN
RL
SAID TO BE THE SAME AS
EN
SL

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