e/NL-complete

Information
has gloss	eng: In computational complexity theory, NL-Complete is a complexity class which is complete for NL. It contains the most "difficult" or "expressive" problems in NL. If a method exists for solving any one of the NL-complete problems in logarithmic memory space, then NL=L.
lexicalization	eng: NL-complete
instance of	e/Complexity class