Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It only takes a minute to sign up.
Sign up to join this community
Let $Ax\equiv b\bmod q$ be a $n\times n$ modular linear system known to have $0/1$ solution where $q$ is a large prime. We can solve in $NC^2$ for general linear systems using determinant and matrix inverse computations.
Can the above be solved in $NC^1$?
