Explore relationships

Logarithmic space

In computational complexity theory, L (also known as LSPACE, LOGSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved by a deterministic Turing machine using a logarithmic amount of writable memory space.

Use + to expand a branch. Click a topic name to open its summary.