The class of decision problems solvable by an NL machine such that
Defined in [BDH+92], where it was also shown that LogFew is contained in ModkL for all k>1.
Has the same relation to L as ModkP does to P.
For any prime k, ModkL contains SL [KW93].
For any prime k, ModkLModkL = ModkL [HRV00].
For any k>1, contains LogFew [BDH+92].