Information for "L (complexity)"

Basic information

Display title	L (complexity)
Default sort key	L (complexity)
Page length (in bytes)	7,994
Namespace ID	0
Page ID	284607
Page content language	en - English
Page content model	wikitext
Indexing by robots	Allowed
Number of redirects to this page	0
Counted as a content page	Yes
HandWiki item ID	None

Edit	Allow all users (infinite)
Move	Allow all users (infinite)

Page creator	imported>HamTop
Date of page creation	17:40, 6 February 2024
Latest editor	imported>HamTop
Date of latest edit	17:40, 6 February 2024
Total number of edits	1
Recent number of edits (within past 90 days)	0
Recent number of distinct authors	0

Transcluded templates (33)	Templates used on this page: Template:Citation/core (view source) Template:Citation/identifier (view source) Template:Citation/make link (view source) Template:Cite book (view source) Template:Cite conference (view source) Template:Cite journal (view source) Template:Cite web (view source) Template:ComplexityClasses (view source) Template:ECCC (view source) Template:Harvard citation text (view source) Template:Harvp (view source) Template:Harvtxt (view source) Template:Hide in print (view source) Template:Imbox (view source) Template:Main other (view source) Template:Navbox (view source) Template:Only in print (view source) Template:Reflist (view source) Template:Reflist/styles.css (view source) Template:Short description (view source) Template:Sourceattribution (view source) Template:Tmath (view source) Template:Unsolved (view source) Template:Wipe (view source) Module:Arguments (view source) Module:Check for unknown parameters (view source) Module:Footnotes (view source) Module:Message box (view source) Module:Message box/configuration (view source) Module:Navbar (view source) Module:Navbox (view source) Module:No globals (view source) Module:Yesno (view source)

Description	Content
Article description: (`description`) This attribute controls the content of the `description` and `og:description` elements.	In computational complexity theory, L (also known as LSPACE 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...

Information from Extension:WikiSEO