in reply to Re: decomposing binary matrices
in thread decomposing binary matrices
I think that approach has possibilities, though it might need some modification - there is no guarantee that the row with fewest bits is separable. Consider, say:
.. from which {B, C, D} is a separable submatrix. I'd have to think further whether I can easily construct an example that defeats the approach on both rows and columns simultaneously - it'd certainly need a larger matrix (at least 7x7 I think), but I think the same general idea could throw up a proper counterexample.A: 1 1 0 0 0 B: 1 0 1 1 0 C: 1 0 1 1 0 D: 1 0 1 1 0 E: 1 1 1 1 1
At the risk of wasting your time ...
Not a waste by any means - many of the suggestions so far could maybe be adaptable to a full solution. It's just a question of whether the adapted version would end up any quicker than going brute force in the first place. :)
Hugo
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^3: decomposing binary matrices
by BrowserUk (Patriarch) on Feb 16, 2007 at 23:11 UTC | |
by hv (Prior) on Feb 17, 2007 at 13:11 UTC |
In Section
Seekers of Perl Wisdom