How many bits needed to describe completely random function?
-
04-11-2019 - |
Pergunta
I read this sentence on mit.ocw and don't understand why this completely random function would need $|U|\log n$ bits to be described?
Unfortunately, if we choose a hash function h that happens to be a completely random function from U to [n], we would actually need $|U|\log n$ bits to describe it.
Nenhuma solução correta
Licenciado em: CC-BY-SA com atribuição
Não afiliado a cs.stackexchange