L (complexity)
Complexity class (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. Formally, the Turing machine has two tapes, one of which encodes the input and can only be read, whereas the other tape has logarithmic size but can be written as well as read.
Nº Q1192782 ★★
Uncommon · Knowledge
L (complexity)
Complexity class (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. Formally, the Turing machine has two tapes, one of which encodes the input and can only be read, whereas the other tape has logarithmic size but can be written as well as read.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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. Formally, the Turing machine has two tapes, one of which encodes the input and can only be read, whereas the other tape has logarithmic size but can be written as well as read. Logarithmic space is sufficient to hold a constant number of pointers into the input and a logarithmic number of Boolean flags, and many basic logspace algorithms use the memory in this way.
Text: Wikipédia, CC BY-SA 4.0. · Image: Cosmia Nebula (CC BY-SA 4.0) ·
Related cards
NL (complexity)
Complexity class
Nº Q12857599 ★
PSPACE
Complexity class
Nº Q500716 ★
P (complexity)
Computational complexity class of problems
Nº Q846354 ★★
PSPACE-complete
Complexity class
Nº Q905967 ★
Computational complexity
Measure of the amount of resources needed to run an algorithm or solve a computational problem
Nº Q5157286 ★★★
NC (complexity)
Complexity class
Nº Q1141840 ★