L

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Science and technology

In collections

Nobody has pulled it yet.

What Wikipedia says

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.

Excerpt from the Wikipedia article “L (complexity)”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Cosmia Nebula, CC BY-SA 4.0, via Wikimedia Commons.