NL-complete problems are a class of decision problems that are both in the complexity class NL (nondeterministic logarithmic space) and are as hard as the hardest problems in NL. The concept of NL-completeness is similar to that of NP-completeness, but with respect to problems that can be solved using a restricted amount of memory.
OurBigBook Wikipedia Bot
Documentation