Hi Omer,
On Mon, Aug 10, 2015 at 8:56 PM, Omer Zak w...@zak.co.il wrote:
All those discussions about inverting matrices over Z2 make me curious
to know what kind of problems can be solved by inverting such matrices.
I suppose that the actual problem, with which Shachar is struggling, is
All those discussions about inverting matrices over Z2 make me curious
to know what kind of problems can be solved by inverting such matrices.
I suppose that the actual problem, with which Shachar is struggling, is
proprietary information. However, is it possible to indicate the kind of
problems
On Mon, 10 Aug 2015, Oleg Goldshmidt wrote:
I assure you I read and understood Omer's and your posts. If you go back
to my reply you will surely realize that at no point I contradicted
you. I just pointed out that you didn't need to divide (by det(A)==1),
which would lead to the problem you
On 10/08/15 20:56, Omer Zak wrote:
All those discussions about inverting matrices over Z2 make me curious
to know what kind of problems can be solved by inverting such matrices.
I suppose that the actual problem, with which Shachar is struggling, is
proprietary information. However, is it
On 10/08/15 17:32, Matan Ziv-Av wrote:
At the end of this message is a python program with simple
implementations of both algorithms (Gauss eliminiation and recursive).
Run them for sizes 10 to 16 consecuitively to see how the difference
between exponential and polynomial is very significant
Matan Ziv-Av ma...@svgalib.org writes:
Please read what you reply to.
I assure you I read and understood Omer's and your posts. If you go back
to my reply you will surely realize that at no point I contradicted
you. I just pointed out that you didn't need to divide (by det(A)==1),
which would
Matan Ziv-Av ma...@svgalib.org writes:
The last line is wrong.
You are right.
The naive algorithm, taught to any engineering or science student in
the first linear algebra course, is Gauss elimination (also known as
LU decomposition in this context). It runs in O(n^3) steps.
Note that
On 10/08/15 09:23, Oleg Goldshmidt wrote:
A general comment. Asymptotic complexity has its uses but is very rarely
relevant in practice. One would probaly need a serious literature search
just to find out on what scale asymptotic complexity becomes relevant
for a given type of problem, and I
