{"title":"","type":"rich","version":"1.0","description":"2ch\u306e\u30b9\u30ec\u30c3\u30c9\u3067\u53cd\u5fdc\u3059\u308b\u306e\u306f\u826f\u304f\u306a\u3044\u306a\u3041\u3068\u601d\u3063\u305f\u306e\u3067, \u3053\u3053\u306b\u30e1\u30e2\u3092\u6b8b\u3057\u3066\u304a\u304d\u307e\u3059. \u307e\u3041\u305d\u3082\u305d\u3082\u4eee\u5b9a\u306b\u3064\u3063\u3053\u3080\u306e\u3082\u30a2\u30ec\u3067\u3059\u304c. \u683c\u5b50\u306e\u88ab\u8986\u534a\u5f84\u3092\u8a08\u7b97\u3059\u308b\u554f\u984c\u304cNP\u306b\u5c5e\u3059\u308b\u3053\u3068\u3092\u308f\u3057\u304c\u8a3c\u660e\u3057\u305f\u3089\u3001 V. Guruswami, D. Micciancio, and O. Regev \"The complexity of the covering radius problem\" (CCC 2004, Computational Complexity 2005) \u306b\u8272\u3005\u7d50\u679c\u304c\u66f8\u304b\u308c\u3066\u3044\u307e\u3059. \u3053\u306e\u4e2d\u3067\u306f, GapCRP_2\u306fAM\u306b\u5165\u308b\u3053\u3068\u304c\u77e5\u3089\u308c\u3066\u3044\u307e\u3059. Exact version\u306b\u3064\u3044\u3066\u306f\u307e\u3060\u2026","image_url":null,"published":"2008-06-29 13:02:03","blog_url":"https://186.hatenablog.com/","categories":["CS","lattice"],"url":"https://186.hatenablog.com/entry/20080629/1214712123","height":"190","blog_title":"186 @ hatenablog","provider_url":"https://hatena.blog","width":"100%","author_name":"smoking186","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2F186.hatenablog.com%2Fentry%2F20080629%2F1214712123\" title=\" - 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>","author_url":"https://blog.hatena.ne.jp/smoking186/","provider_name":"Hatena Blog"}