{"published":"2006-07-05 20:44:44","url":"https://186.hatenablog.com/entry/20060705/1152099884","author_url":"https://blog.hatena.ne.jp/smoking186/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2F186.hatenablog.com%2Fentry%2F20060705%2F1152099884\" title=\" $\\Pr[collision]$ is negligible in $n$ - 186 @ hatenablog\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","height":"190","version":"1.0","width":"100%","author_name":"smoking186","blog_url":"https://186.hatenablog.com/","provider_name":"Hatena Blog","type":"rich","description":"\u4e09\u65e5\u5538\u3063\u3066\u3088\u3046\u3084\u304f\u601d\u3044\u3064\u3044\u305f\u306e\u3067, \u3084\u3063\u3068\u78ba\u7387\u306e\u8a55\u4fa1\u304c\u51fa\u6765\u305f. Impagliazzo and Zuckerman ``How to recycle random bits'' (FOCS '89) *1\u306bRegularity Lemma\u304c\u8f09\u3063\u3066\u3044\u308b\u306e\u3067\u305d\u308c\u3092\u4f7f\u3063\u3066\u4f55\u3068\u304b\u65e2\u5b58\u306e\u8a3c\u660e\u3092\u53c2\u8003\u306b\u3057\u306a\u304c\u3089\u3084\u308a\u304f\u308a. \u5411\u3053\u3046\u306e\u8a3c\u660e\u306b\u96e3\u3057\u3044\u3068\u3053\u308d\u306f\u5168\u90e8\u62bc\u3057\u4ed8\u3051\u3066\u521d\u7b49\u7684\u306b\u8a3c\u660e\u3057\u305f. \u5f8c\u306f\u5ef6\u3005\u3068\u30d1\u30e9\u30e1\u30fc\u30bf\u306e\u8a2d\u5b9a\u304b, \u3060\u308b\u3044. \u305d\u3046\u3044\u3048\u3070, [IZ]\u306e4\u7ae0\u306bLeftover Hash Lemma\u3068\u3044\u3046\u7ae0\u304c\u3042\u3063\u3066, The following lemma is a somewhat stronger and cl\u2026","blog_title":"186 @ hatenablog","provider_url":"https://hatena.blog","image_url":null,"title":" $\\Pr[collision]$ is negligible in $n$","categories":["study"]}