Matches in DBpedia 2016-04 for { ?s ?p "In computational complexity theory, NL (Nondeterministic Logarithmic-space) is the complexity class containing decision problems which can be solved by a nondeterministic Turing machine using a logarithmic amount of memory space.NL is a generalization of L, the class for logspace problems on a deterministic Turing machine."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- NL_(complexity) comment "In computational complexity theory, NL (Nondeterministic Logarithmic-space) is the complexity class containing decision problems which can be solved by a nondeterministic Turing machine using a logarithmic amount of memory space.NL is a generalization of L, the class for logspace problems on a deterministic Turing machine.".
- Q12857599 comment "In computational complexity theory, NL (Nondeterministic Logarithmic-space) is the complexity class containing decision problems which can be solved by a nondeterministic Turing machine using a logarithmic amount of memory space.NL is a generalization of L, the class for logspace problems on a deterministic Turing machine.".