Timeline for Encoding numbers with relationship into one and back
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2021 at 7:57 | vote | accept | Rise of Kingdom | ||
| Nov 18, 2020 at 18:09 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
added 2 characters in body
|
| Nov 18, 2020 at 8:48 | comment | added | Mattias Andersson | There are $2^{|S|}$ different subsets of $S$ so you need an $|S|$-bit number to be able to identify all possible subsets. | |
| Nov 18, 2020 at 6:50 | comment | added | Rise of Kingdom | Another possible issue is that the number will goes very big such that 64 bits machine cannot represent when the size of S is large. | |
| Nov 18, 2020 at 6:47 | comment | added | Rise of Kingdom | Thanks for your answer. The function is quite simple. The only issue is the length of bits increases linearly with the size of S'. Can we find a good way to reduce the memory cost (e.g., increasing sub-linearly)? | |
| Nov 18, 2020 at 0:11 | history | answered | Mattias Andersson | CC BY-SA 4.0 |