On 12 March 2016 at 18:45, Dima Pasechnik wrote:
> this lower bound is too optimistic. E.g. consider the nx(n choose 2) matrix
> with 2 nonzeros per column. Erasing any two rows creates a O(n)
> indistinguishable columns.
Ah, then I mis-stated the problem. I will go away and come back when
I h
this lower bound is too optimistic. E.g. consider the nx(n choose 2) matrix
with 2 nonzeros per column. Erasing any two rows creates a O(n)
indistinguishable columns.
Dima
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from th
Is this a known problem? Suppose I have a matrix A of size n x m and
entries in {0,1}, with the property that the columns are distinct. I
want to delete as many rows rows as possible without spoiling that
property, ending up with a subset of the rows which is as small as
possible, still with the
