Module m4ri 

Structs

M4riTable 🔒

M4RI works as follows — first row reduce k rows using the naive algorithm. We then construct a table of all 2^k linear combinations of these rows. This can be done in O(2^k) time. We then use this table to reduce the remaining rows, so that each row takes O(num_columns) time, which reduces the time taken by a factor of k x density.