troubleshooting Question

Rank of square binary matrix - algorithm?

Avatar of Takasaki
Takasaki asked on
C++Math / ScienceAlgorithms
18 Comments1 Solution2628 ViewsLast Modified:
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)
-no Smith
-no SVD

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.

Psuedocodes only, please (C++ notation preferred).

Thanks!
-Tak
Join the community to see this answer!
Join our exclusive community to see this answer & millions of others.
Unlock 1 Answer and 18 Comments.
Join the Community
Learn from the best

Network and collaborate with thousands of CTOs, CISOs, and IT Pros rooting for you and your success.

Andrew Hancock - VMware vExpert
See if this solution works for you by signing up for a 7 day free trial.
Unlock 1 Answer and 18 Comments.
Try for 7 days

”The time we save is the biggest benefit of E-E to our team. What could take multiple guys 2 hours or more each to find is accessed in around 15 minutes on Experts Exchange.

-Mike Kapnisakis, Warner Bros