Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:alsoKnownAs |
DLOGSPACE
|
| gptkbp:closed |
closed under concatenation
closed under Kleene star closed under intersection closed under union closed under complement |
| gptkbp:completeProblem |
undirected s-t connectivity
|
| gptkbp:contains |
P
NL problems such as undirected graph connectivity |
| gptkbp:definedIn |
the class of decision problems solvable by a deterministic Turing machine using logarithmic space
|
| gptkbp:hasResourceBound |
logarithmic space
|
| https://www.w3.org/2000/01/rdf-schema#label |
L (complexity class)
|
| gptkbp:introducedIn |
1970s
|
| gptkbp:machineType |
deterministic Turing machine
|
| gptkbp:notableAchievement |
Reingold's algorithm for undirected connectivity in L
|
| gptkbp:openProblem |
L vs NL
L vs P |
| gptkbp:relatedTo |
gptkb:PSPACE
gptkb:P_(complexity_class) gptkb:NL_(complexity_class) |
| gptkbp:spaceBound |
O(log n)
|
| gptkbp:standsFor |
Logarithmic space
|
| gptkbp:studiedIn |
theoretical computer science
|
| gptkbp:bfsParent |
gptkb:P_(complexity_class)
|
| gptkbp:bfsLayer |
6
|