Algorithm for solving equations whose coefficients are binary

25 Views Asked by At

Let $A$ be a $d$-dimensional matrix whose entries are 0 or 1. Is there an efficient or specialized algorithm for solving $A \vec x = \vec 0$? If so, how many times (complexities) depend on the $d$?