Content deleted Content added
→Quotation without attribution: new section |
|||
Line 56:
Whichever column you pick, you end up with choosing the row B and reducing the matrix to a 1x0 matrix (because both columns get removed, but the row A doesn't). Yet this is a solution to the problem, right? So we should consider a 1x0 matrix to be empty but a 0x1 matrix to be non-empty. Everything works fine if an empty matrix is defined to be any matrix with 0 columns (and considering 0xn and nx0 matrices where n is not 0 as different from the 0x0 matrix in the first place). It is a somewhat peculiar notion of "empty", though, and I'm not quite bold enough to be sure that I've understood everything correctly on such a quick peek here. After all, it's Knuth's paper, and I don't have any citations for any of this. Hopefully someone else has the energy to look at this someday :-) -- [[User:Coffee2theorems|Coffee2theorems]] ([[User talk:Coffee2theorems|talk]]) 23:02, 4 July 2008 (UTC)
:I think the algorithm is incorrect as in missing the following rule:
: 2. If there is a column ''c'' without any 1s, terminate unsuccessfully, otherwise choose a column ''c'' ([[deterministic algorithm|deterministically]]). -- [[Special:Contributions/139.18.249.154|139.18.249.154]] ([[User talk:139.18.249.154|talk]]) 13:15, 18 October 2011 (UTC)
==Quotation without attribution==
| |||