Editing L (complexity) (section)

==References==
* {{cite book | zbl=1193.68112 | last1=Arora | first1=Sanjeev | last2=Barak | first2=Boaz | title=Computational complexity. A modern approach | publisher=[[Cambridge University Press]] | year=2009 | isbn=978-0-521-42426-4}}
* {{cite book|first=Christos|last=Papadimitriou| year = 1993 | title = Computational Complexity | publisher = Addison Wesley | edition = 1st | isbn = 0-201-53082-1| at = Chapter 16: Logarithmic space, pp.&nbsp;395–408}}
* {{cite book | first = Michael | last = Sipser | year = 1997 | title = Introduction to the Theory of Computation | publisher = PWS Publishing | isbn = 0-534-94728-X| at = Section 8.4: The Classes L and NL, pp.&nbsp;294–296 | url-access = registration | url = https://archive.org/details/introductiontoth00sips }}
* {{cite book | last1=Garey | first1=M.R. | author1-link=Michael Garey | last2=Johnson | first2=D.S. | author2-link=David S. Johnson | year=1979 | title=[[Computers and Intractability: A Guide to the Theory of NP-Completeness]] | publisher=W.H. Freeman | isbn=0-7167-1045-5|mr=0519066|oclc=247570676| at=[https://archive.org/details/computersintract0000gare/page/ Section 7.5: Logarithmic Space, pp.&nbsp;177–181] }}
* {{cite journal | last1=Cook | first1=Stephen A. | author1-link=Stephen Arthur Cook | last2=McKenzie | first2=Pierre | title = Problems Complete for Deterministic Logarithmic Space | journal = Journal of Algorithms| volume=8 | number=3 | pages=385–394 |year=1987|issn=0196-6774|doi=10.1016/0196-6774(87)90018-6 | url = http://www.cs.utoronto.ca/~sacook/homepage/cook_mckenzie.pdf}}

{{ComplexityClasses}}

[[Category:Complexity classes]]