Complexity Class L\mathsf{L}

The decision problems that can be solved by a deterministic algorithm using space logarithmic in the size of the input, not counting the read-only input itself.

Reference

Papadimitriou, C.H. (1994). Computational Complexity. Addison-Wesley.