I have a binary square matrix $A$ of size $n=n_1+n_2$. I have to solve system of linear equations $AX=b$. I known for each row out of first $n_1$ entries $l_1$ are 1 and next $n_2$ entries $l_2$ are 1 where $l_1\ll n_1$ and $l_2 \ll n_2$. So matrix is very much sparse. What is the time complexity to find the solution? My matrix is very sparse like $n_2=2^{20}$ and $l_2=20$.

  • $\begingroup$ Are you assuming conventional arithmetic or arithmetic modulo 2? Do you want to find an integer solution, or would a real solution be OK? $\endgroup$ – Brian Borchers Jan 6 at 23:25
  • $\begingroup$ Operations are Arithmetic mod 2 and I need binary solutions. $\endgroup$ – user12290 Jan 8 at 0:45

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Browse other questions tagged or ask your own question.