Timeline for Is there an efficient algorithm that allows to construct a binary word with particular properties related to its horizontal and vertical “subwords”?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 11, 2023 at 9:53 | comment | added | kodlu | see my edit please | |
| Feb 11, 2023 at 9:53 | history | edited | kodlu | CC BY-SA 4.0 |
added 65 characters in body
|
| Feb 11, 2023 at 6:38 | comment | added | lyrically wicked | In the given $16 \times 16$ matrix the $i$-th row (horizontal subword) is equal to the $i$-th column (vertical subword), which contradicts Property #3. | |
| Feb 9, 2023 at 13:04 | history | edited | kodlu | CC BY-SA 4.0 |
added 113 characters in body
|
| Feb 9, 2023 at 12:57 | history | answered | kodlu | CC BY-SA 4.0 |