Parity-L, also known as $\oplus$L, is the set of languages recognized by a non-deterministic Turing machine which can only distinguish between an even number or odd number of "acceptance" paths. A recent related question was asked by Niel de Beaudrap.

My question is the following:

Do we know if NL $\subseteq$ $\oplus$L? Or are these two classes believed to be incomparable?


1 Answer 1


Non-uniformly, NL is contained in parity-L: see http://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/W94/proc.pdf


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.