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.[1][2] Formally, the Turing machine has two tapes, one of which encodes the input and can only be read,[3] 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[1] and a logarithmic number of Boolean flags, and many basic logspace algorithms use the memory in this way.
Complete problems and logical characterization
editEvery non-trivial problem in L is complete under log-space reductions,[4] so weaker reductions are required to identify meaningful notions of L-completeness, the most common being first-order reductions.
A 2004 result by Omer Reingold shows that USTCON, the problem of whether there exists a path between two vertices in a given undirected graph, is in L, showing that L = SL, since USTCON is SL-complete.[5]
One consequence of this is a simple logical characterization of L: it contains precisely those languages expressible in first-order logic with an added commutative transitive closure operator (in graph theoretical terms, this turns every connected component into a clique). This result has application to database query languages: data complexity of a query is defined as the complexity of answering a fixed query considering the data size as the variable input. For this measure, queries against relational databases with complete information (having no notion of nulls) as expressed for instance in relational algebra are in L.
Related complexity classes
editL is a subclass of NL, which is the class of languages decidable in logarithmic space on a nondeterministic Turing machine. A problem in NL may be transformed into a problem of reachability in a directed graph representing states and state transitions of the nondeterministic machine, and the logarithmic space bound implies that this graph has a polynomial number of vertices and edges, from which it follows that NL is contained in the complexity class P of problems solvable in deterministic polynomial time.[6] Thus L???NL???P. The inclusion of L into P can also be proved more directly: a decider using O(log?n) space cannot use more than 2O(log?n)?=?nO(1) time, because this is the total number of possible configurations.
L further relates to the class NC in the following way: NC1???L???NL???NC2. In words, given a parallel computer C with a polynomial number O(nk) of processors for some constant k, any problem that can be solved on C in O(log?n) time is in L, and any problem in L can be solved in O(log2?n) time on C.
Important open problems include whether L?=?P,[2] and whether L?=?NL.[7] It is not even known whether L?=?NP.[8]
The related class of function problems is FL. FL is often used to define logspace reductions.
Random versions
editJust as how P has several random versions: BPP, ZPP, PP, and RP, there are several random versions of L.
Bounded-error Probability L (BPL) is defined like BPP, as the complexity class of problems solvable with a logspace Turing machine such that:
- Other than the usual tapes of a logspace Turing machine, the machine also takes a tape filled with random bits.
- The randomness is read-only and one-way. That is, the read-head on the random tape can only move in one direction. To reference a previous random bit, the machine must store it in the work tape.
- The Turing machine has to halt for every input and every random tape.
- If the answer is 'yes' then the machine accepts with probability at least 2/3. If the answer is 'no' then the machine rejects with probability at least 2/3.
It is contained in NC2, which is contained in P.[9]
BP?L is defined the same as BPL, except that the machine is allowed to read the random tape both forwards and backwards. It contains BPL. It is also exactly equal to the class of languages that are nearly logspace: a language is nearly logspace if, relative to almost every oracle, the language is in L.[10]
ZP?L is defined like BP?L, except that the machine may output "unknown", and must never make an error (i.e. accept when the answer is 'no', and vice versa). The relation of ZP?L to BP?L, is the same as the relation of ZPP to BPP. It contains BPL and is contained by BP?L.[10]
Randomized L (RL) is defined like BPL:
- Other than the usual tapes of a logspace Turing machine, the machine also takes a read-only one-way tape filled with random bits.
- The Turing machine has to halt for every input and every random tape.
- If the answer is 'yes,' accept with probability at least 1/2.
- If the answer is 'no,' always reject.
Also, it must always run in polynomial time (since otherwise we would just get NL). It is strongly suspected that RL = L.[11]
Both BPL and RL are contained in Steve's Class.[12]
Probabilistic L (PL) has the same relation to L that PP has to P:
- If the answer is 'yes,' accept with probability at least 1/2.
- If the answer is 'no,' reject with probability at least 1/2.
It contains BPL, and is contained by NC2.[13]
Additional properties
editL is low for itself, because it can simulate log-space oracle queries (roughly speaking, "function calls which use log space") in log space, reusing the same space for each query.
Other uses
editThe main idea of logspace is that one can store a polynomial-magnitude number in logspace and use it to remember pointers to a position of the input.
The logspace class is therefore useful to model computation where the input is too big to fit in the RAM of a computer. Long DNA sequences and databases are good examples of problems where only a constant part of the input will be in RAM at a given time and where we have pointers to compute the next part of the input to inspect, thus using only logarithmic memory.
See also
edit- L/poly, a nonuniform variant of L that captures the complexity of polynomial-size branching programs
Notes
edit- ^ a b Sipser (1997), p.?295, Definition 8.12
- ^ a b Garey & Johnson (1979), p.?177
- ^ On a read/write input tape, a linear amount of memory could be obtained by packing of symbols (as in the proof of the linear speedup theorem), thus evading the logspace contraint.
- ^ See Garey & Johnson (1979), p.?179, Theorem 7.13 (claim 2)
- ^ Reingold, Omer (2005). Undirected ST-connectivity in log-space. STOC'05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing. ACM, New York. pp.?376–385. doi:10.1145/1060590.1060647. MR?2181639. ECCC?TR04-094.
- ^ Sipser (1997), Corollary?8.21, p.?299.
- ^ Sipser (1997), p.?297; Garey & Johnson (1979), p.?180
- ^ "Complexity theory - is it possible that L?=?NP".
- ^ Borodin, A.; Cook, S.; Pippenger, N. (2025-08-14). "Parallel computation for well-endowed rings and space-bounded probabilistic machines". Information and Control. 58 (1): 113–136. doi:10.1016/S0019-9958(83)80060-6. ISSN?0019-9958.
- ^ a b Nisan, Noam (2025-08-14). "On read once vs. multiple access to randomness in logspace". Theoretical Computer Science. 107 (1): 135–144. doi:10.1016/0304-3975(93)90258-U. ISSN?0304-3975.
- ^ Reingold, Omer; Trevisan, Luca; Vadhan, Salil (2025-08-14). "Pseudorandom walks on regular digraphs and the RL vs. L problem". Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing. STOC '06. New York, NY, USA: Association for Computing Machinery. pp.?457–466. doi:10.1145/1132516.1132583. ISBN?978-1-59593-134-4.
- ^ Nisan, Noam (2025-08-14). "RL ? SC". Computational Complexity. 4 (1): 1–11. doi:10.1007/BF01205052. ISSN?1420-8954.
- ^ Cook, Stephen A. (2025-08-14). "A taxonomy of problems with fast parallel algorithms". Information and Control. International Conference on Foundations of Computation Theory. 64 (1): 2–22. doi:10.1016/S0019-9958(85)80041-3. ISSN?0019-9958.
References
edit- Arora, Sanjeev; Barak, Boaz (2009). Computational complexity. A modern approach. Cambridge University Press. ISBN?978-0-521-42426-4. Zbl?1193.68112.
- Papadimitriou, Christos (1993). Computational Complexity (1st?ed.). Addison Wesley. Chapter 16: Logarithmic space, pp.?395–408. ISBN?0-201-53082-1.
- Sipser, Michael (1997). Introduction to the Theory of Computation. PWS Publishing. Section 8.4: The Classes L and NL, pp.?294–296. ISBN?0-534-94728-X.
- Garey, M.R.; Johnson, D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman. Section 7.5: Logarithmic Space, pp.?177–181. ISBN?0-7167-1045-5. MR?0519066. OCLC?247570676.
- Cook, Stephen A.; McKenzie, Pierre (1987). "Problems Complete for Deterministic Logarithmic Space" (PDF). Journal of Algorithms. 8 (3): 385–394. doi:10.1016/0196-6774(87)90018-6. ISSN?0196-6774.