Timeline for Minimum number of length of sublist so that they have one element in common
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 2, 2024 at 4:57 | vote | accept | esteregg | ||
| Dec 1, 2024 at 10:03 | answer | added | kodlu | timeline score: 1 | |
| Dec 1, 2024 at 6:00 | comment | added | esteregg | Let it be assumed that storing list as large as 10^80 is possible | |
| S Dec 1, 2024 at 5:51 | history | suggested | madhurkant | CC BY-SA 4.0 | Tried to limit its scope to this site. |
| Dec 1, 2024 at 5:48 | review | Suggested edits | |||
| S Dec 1, 2024 at 5:51 | |||||
| Dec 1, 2024 at 4:16 | comment | added | esteregg | @madhurkant You can edit | |
| Dec 1, 2024 at 4:16 | comment | added | esteregg | @Max I want to know that while brute forcing what are the minimum number of attempt needed? | |
| Dec 1, 2024 at 2:57 | comment | added | madhurkant | I am asking you to modify it so it meets standards here as pointed out by @poncho. Its okay to accept that you don't know instead of arguing. Your question need significant changes and I will be doing it only if you ensure to accept my edit because doing so consumes time. | |
| Nov 30, 2024 at 17:45 | comment | added | Max | Assuming this is considered to be on-topic, which I’m not convinced it is, the actual question is still ambiguous. Are we analyzing the algorithm provided, or trying to find the best algorithm to solve the problem? | |
| Nov 30, 2024 at 16:31 | comment | added | poncho♦ | How is it cryptographic? | |
| Nov 30, 2024 at 15:58 | history | edited | esteregg | CC BY-SA 4.0 | Minor formatting |
| Nov 30, 2024 at 12:34 | comment | added | esteregg | @madhurkant I think its enough to be considered here. This is equally mathematic and cryptographic. | |
| Nov 30, 2024 at 12:27 | history | asked | esteregg | CC BY-SA 4.0 |