network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 6 months |
| seen | Apr 30 at 16:09 | |
| stats | profile views | 2 |
|
Nov 11 |
awarded | Editor |
|
Nov 11 |
revised |
Can there be two hash functions without common collisions? add concession |
|
Nov 8 |
comment |
Can there be two hash functions without common collisions? Stephen, that actually depends. If the pigeon hole argument applies, then of course any hash has a collision. If we can restrict the input space to be not bigger than the output space then this is not true: consider the function F(x) = 0 which makes G(x) = x. |
|
Nov 8 |
awarded | Teacher |
|
Nov 2 |
answered | Can there be two hash functions without common collisions? |
