What is the most rapid algorithmic way you can think of to find the rank of a square, binary matrix?
-no Gauss (e.g. pivoting)
Preferably with XOR row and col operations only.
I don't want to access each matrix element individually.
I guess I'm looking for linear independence tests for each col/row and counting those that are as such.