{"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2F186.hatenablog.com%2Fentry%2F20070423%2F1177255661\" title=\" &lt;a href=&quot;http://icalp07.ii.uni.wroc.pl/accept.html&quot;&gt;ICALP 2007 - accepted papers&lt;/a&gt; - 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>","description":"\u3042\u3068\u3067\u30c1\u30a7\u30c3\u30af\u3059\u308b. \u683c\u5b50\u95a2\u4fc2\u306f\u7121\u3057\u304b. \u3042\u308b\u3058\u3083\u306d\u30fc\u304b(;\u00b4\u0414\uff40) Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima Johannes Bl\u00f6mer and Stefanie Naewe In this paper we introduce a new lattice problem, the subspace avoiding problem (SAP). We describe a probabilistic single exponential time algorithm for \u2026","url":"https://186.hatenablog.com/entry/20070423/1177255661","width":"100%","blog_url":"https://186.hatenablog.com/","version":"1.0","image_url":null,"author_url":"https://blog.hatena.ne.jp/smoking186/","published":"2007-04-23 00:27:41","provider_name":"Hatena Blog","categories":["crypt","CS"],"title":" <a href=\"http://icalp07.ii.uni.wroc.pl/accept.html\">ICALP 2007 - accepted papers</a>","type":"rich","height":"190","blog_title":"186 @ hatenablog","provider_url":"https://hatena.blog","author_name":"smoking186"}