bn:00279005n
Noun Named Entity
Categories: Complexity classes
EN
L  Deterministic logspace  DLOGSPACE  log space  logarithmic space
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
Definitions
Relations
Sources
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
A complexity class in computational complexity theory Wikipedia Disambiguation
HAS PART
PART OF
SAID TO BE THE SAME AS
Wikipedia
Wikidata
EN
L
Wikidata Alias