Timeline for Checking a matrix for distinct rows
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 8, 2019 at 14:01 | comment | added | David E Speyer | I think you are asking for a theoretical answer, but I'll give a programming note: the SAGE function uniq() is meant for this task doc.sagemath.org/html/en/reference/misc/sage/misc/misc.html . | |
| Aug 8, 2019 at 13:20 | comment | added | Vít Tuček | Are you asking for techniques to prove that the rows are distinct or are you asking for programming techniques that will help you check that the rows are distinct? In the former case, I think you need to be more specific and give us the definition of the matrix. | |
| Aug 8, 2019 at 13:16 | comment | added | Yoav Kallus | I know this is not what you're asking for, but note also that the "checking by hand" complexity can be reduced from naive O(n^2) to O(n log n) by sorting and to O(n) using a hash table. | |
| Aug 8, 2019 at 12:54 | answer | added | Robert Israel | timeline score: 2 | |
| Aug 8, 2019 at 12:34 | history | asked | GA316 | CC BY-SA 4.0 |