L (LSPACE - DLOGSPACE) is a type of complexity class that contains the set of decision problems that can be solved by a deterministic Turing machine using a logarithmic amount of writable memory space Resources https://en.wikipedia.org/wiki/L_(complexity)