NL (complexity)
id:
nl-complexity-196-7940084
title:
NL (complexity)
text:
In computational complexity theory, NL is the complexity class containing decision problems that 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. Since any deterministic Turing machine is also a nondeterministic Turing machine, we have that L is contained in NL. NL can be formally defined in terms of the computational resource nondeterministic space as NL
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/NL_(complexity)
date created:
date modified:
2023-12-29T10:29:35Z
main entity:
{"identifier":"Q12857599","url":"https://www.wikidata.org/entity/Q12857599"}
image:
fields total:
13
integrity:
13