|
gptkbp:instanceOf
|
theoretical computer science
|
|
gptkbp:closed
|
gptkb:intersection
Union
complement
|
|
gptkbp:completeProblemUnder
|
logspace reductions
|
|
gptkbp:contains
|
PATH problem
ST-connectivity problem
|
|
gptkbp:definedIn
|
set of decision problems solvable by a nondeterministic Turing machine using logarithmic space
|
|
gptkbp:equivalentTo
|
co-NL
|
|
gptkbp:hasSubgroup
|
gptkb:P_(complexity_class)
gptkb:L_(complexity_class)
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
NL (complexity class)
|
|
gptkbp:importantProblem
|
directed s-t connectivity
graph reachability
|
|
gptkbp:introducedIn
|
1970s
|
|
gptkbp:notKnownToBeEqualTo
|
gptkb:P_(complexity_class)
gptkb:L_(complexity_class)
|
|
gptkbp:numberOfIssues
|
PATH problem
|
|
gptkbp:provenBy
|
gptkb:Immerman–Szelepcsényi_theorem
|
|
gptkbp:relatedTo
|
gptkb:NP_(complexity_class)
gptkb:P_(complexity_class)
gptkb:L_(complexity_class)
co-NL
|
|
gptkbp:spaceBound
|
O(log n)
|
|
gptkbp:standsFor
|
Nondeterministic Logarithmic space
|
|
gptkbp:typicalMachineModel
|
gptkb:nondeterministic_Turing_machine
|
|
gptkbp:usedIn
|
theoretical computer science
|
|
gptkbp:bfsParent
|
gptkb:P_(complexity_class)
|
|
gptkbp:bfsLayer
|
6
|