The class of decision problems solvable by a nondeterministic logspace Turing machine, such that
Defined in [BDH+92], where it was also shown that ModZkL contains LogFewNL for all k>1.
Same as FewP but for logspace-bounded (i.e. NL) machines.
Defined in [BDH+92], where it was also shown that LogFewNL is contained in ModZkL for all k>1.